Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945300355.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-COL-S02J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945300355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678836157792

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-14 23:22:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 23:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 23:22:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 23:22:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 23:22:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 521 ms
[2023-03-14 23:22:39] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 23:22:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2023-03-14 23:22:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 3 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 23:22:41] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-14 23:22:41] [INFO ] Computed 26 place invariants in 10 ms
[2023-03-14 23:22:41] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-14 23:22:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-14 23:22:41] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:6
[2023-03-14 23:22:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-14 23:22:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-14 23:22:41] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2023-03-14 23:22:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-14 23:22:41] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :8 sat :1
[2023-03-14 23:22:41] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 23:22:41] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
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 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 23 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
[2023-03-14 23:22:41] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2023-03-14 23:22:41] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-14 23:22:42] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 23:22:42] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2023-03-14 23:22:42] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 23:22:42] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-14 23:22:42] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 28 ms.
[2023-03-14 23:22:42] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 78 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 604 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 604 transition count 1106
Applied a total of 18 rules in 64 ms. Remains 604 /614 variables (removed 10) and now considering 1106/1114 (removed 8) transitions.
[2023-03-14 23:22:42] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2023-03-14 23:22:42] [INFO ] Computed 48 place invariants in 53 ms
[2023-03-14 23:22:42] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2023-03-14 23:22:42] [INFO ] Flow matrix only has 1002 transitions (discarded 16 similar events)
// Phase 1: matrix 1002 rows 604 cols
[2023-03-14 23:22:42] [INFO ] Computed 48 place invariants in 22 ms
[2023-03-14 23:22:43] [INFO ] Implicit Places using invariants in 377 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 382 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/614 places, 1018/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 594 transition count 1002
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 578 transition count 986
Applied a total of 18 rules in 18 ms. Remains 578 /596 variables (removed 18) and now considering 986/1018 (removed 32) transitions.
[2023-03-14 23:22:43] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
// Phase 1: matrix 970 rows 578 cols
[2023-03-14 23:22:43] [INFO ] Computed 40 place invariants in 15 ms
[2023-03-14 23:22:43] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-14 23:22:43] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
[2023-03-14 23:22:43] [INFO ] Invariant cache hit.
[2023-03-14 23:22:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:22:48] [INFO ] Implicit Places using invariants and state equation in 4568 ms returned []
Implicit Place search using SMT with State Equation took 4915 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 578/614 places, 986/1114 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5974 ms. Remains : 578/614 places, 986/1114 transitions.
Support contains 78 out of 578 places after structural reductions.
[2023-03-14 23:22:48] [INFO ] Flatten gal took : 77 ms
[2023-03-14 23:22:48] [INFO ] Flatten gal took : 64 ms
[2023-03-14 23:22:48] [INFO ] Input system was already deterministic with 986 transitions.
Finished random walk after 116 steps, including 0 resets, run visited all 10 properties in 5 ms. (steps per millisecond=23 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 8 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 986/986 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 570 transition count 978
Applied a total of 16 rules in 30 ms. Remains 570 /578 variables (removed 8) and now considering 978/986 (removed 8) transitions.
[2023-03-14 23:22:48] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2023-03-14 23:22:48] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-14 23:22:49] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2023-03-14 23:22:49] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:22:49] [INFO ] Invariant cache hit.
[2023-03-14 23:22:49] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-14 23:22:49] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:22:49] [INFO ] Invariant cache hit.
[2023-03-14 23:22:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:22:53] [INFO ] Implicit Places using invariants and state equation in 4555 ms returned []
Implicit Place search using SMT with State Equation took 4892 ms to find 0 implicit places.
[2023-03-14 23:22:53] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:22:53] [INFO ] Invariant cache hit.
[2023-03-14 23:22:54] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/578 places, 978/986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5727 ms. Remains : 570/578 places, 978/986 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-04 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:(LEQ 1 (ADD s292 s293 s294 s295 s296 s297 s298 s299))], 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 2730 reset in 386 ms.
Product exploration explored 100000 steps with 2700 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 23:22:55] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:22:55] [INFO ] Invariant cache hit.
[2023-03-14 23:22:56] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-14 23:22:56] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 40 ms returned sat
[2023-03-14 23:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:22:57] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2023-03-14 23:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:22:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-14 23:22:57] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 79 ms returned sat
[2023-03-14 23:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:22:59] [INFO ] [Nat]Absence check using state equation in 1369 ms returned sat
[2023-03-14 23:22:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:22:59] [INFO ] [Nat]Added 96 Read/Feed constraints in 199 ms returned sat
[2023-03-14 23:22:59] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2023-03-14 23:22:59] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2023-03-14 23:22:59] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2023-03-14 23:22:59] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 1 ms to minimize.
[2023-03-14 23:22:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 694 ms
[2023-03-14 23:23:00] [INFO ] Computed and/alt/rep : 696/2557/688 causal constraints (skipped 272 transitions) in 62 ms.
[2023-03-14 23:23:03] [INFO ] Added : 246 causal constraints over 50 iterations in 3705 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 570 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 570/570 places, 978/978 transitions.
Applied a total of 0 rules in 10 ms. Remains 570 /570 variables (removed 0) and now considering 978/978 (removed 0) transitions.
[2023-03-14 23:23:03] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:03] [INFO ] Invariant cache hit.
[2023-03-14 23:23:04] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
[2023-03-14 23:23:04] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:04] [INFO ] Invariant cache hit.
[2023-03-14 23:23:04] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-14 23:23:04] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:04] [INFO ] Invariant cache hit.
[2023-03-14 23:23:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:23:09] [INFO ] Implicit Places using invariants and state equation in 4957 ms returned []
Implicit Place search using SMT with State Equation took 5294 ms to find 0 implicit places.
[2023-03-14 23:23:09] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:09] [INFO ] Invariant cache hit.
[2023-03-14 23:23:09] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6105 ms. Remains : 570/570 places, 978/978 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 23:23:10] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:10] [INFO ] Invariant cache hit.
[2023-03-14 23:23:10] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-14 23:23:10] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 39 ms returned sat
[2023-03-14 23:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:23:11] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2023-03-14 23:23:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:23:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-14 23:23:12] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 71 ms returned sat
[2023-03-14 23:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:23:13] [INFO ] [Nat]Absence check using state equation in 1399 ms returned sat
[2023-03-14 23:23:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:23:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 203 ms returned sat
[2023-03-14 23:23:13] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 0 ms to minimize.
[2023-03-14 23:23:14] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2023-03-14 23:23:14] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2023-03-14 23:23:14] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 0 ms to minimize.
[2023-03-14 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 695 ms
[2023-03-14 23:23:14] [INFO ] Computed and/alt/rep : 696/2557/688 causal constraints (skipped 272 transitions) in 66 ms.
[2023-03-14 23:23:18] [INFO ] Added : 246 causal constraints over 50 iterations in 3634 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2713 reset in 242 ms.
Product exploration explored 100000 steps with 2720 reset in 248 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 978/978 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 570 transition count 978
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 48 place count 570 transition count 1050
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 120 place count 570 transition count 1050
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 554 transition count 1034
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 554 transition count 1034
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 216 place count 554 transition count 1034
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 248 place count 522 transition count 1002
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 280 place count 522 transition count 1002
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 280 rules in 113 ms. Remains 522 /570 variables (removed 48) and now considering 1002/978 (removed -24) transitions.
[2023-03-14 23:23:19] [INFO ] Flow matrix only has 986 transitions (discarded 16 similar events)
// Phase 1: matrix 986 rows 522 cols
[2023-03-14 23:23:19] [INFO ] Computed 40 place invariants in 12 ms
[2023-03-14 23:23:19] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
[2023-03-14 23:23:19] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-14 23:23:19] [INFO ] Flow matrix only has 986 transitions (discarded 16 similar events)
[2023-03-14 23:23:19] [INFO ] Invariant cache hit.
[2023-03-14 23:23:20] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 522/570 places, 1002/978 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1057 ms. Remains : 522/570 places, 1002/978 transitions.
Built C files in :
/tmp/ltsmin4507812908340734025
[2023-03-14 23:23:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4507812908340734025
Running compilation step : cd /tmp/ltsmin4507812908340734025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1677 ms.
Running link step : cd /tmp/ltsmin4507812908340734025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4507812908340734025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5260536774218068315.hoa' '--buchi-type=spotba'
LTSmin run took 13035 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-04 finished in 46323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p1))))))'
Support contains 18 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 986/986 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 570 transition count 978
Applied a total of 16 rules in 28 ms. Remains 570 /578 variables (removed 8) and now considering 978/986 (removed 8) transitions.
[2023-03-14 23:23:34] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2023-03-14 23:23:35] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-14 23:23:35] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
[2023-03-14 23:23:35] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:35] [INFO ] Invariant cache hit.
[2023-03-14 23:23:35] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-14 23:23:35] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:35] [INFO ] Invariant cache hit.
[2023-03-14 23:23:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:23:40] [INFO ] Implicit Places using invariants and state equation in 5200 ms returned []
Implicit Place search using SMT with State Equation took 5540 ms to find 0 implicit places.
[2023-03-14 23:23:40] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:40] [INFO ] Invariant cache hit.
[2023-03-14 23:23:41] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/578 places, 978/986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6434 ms. Remains : 570/578 places, 978/986 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ s350 s164), p1:(LEQ (ADD s2 s3 s4 s5 s6 s7 s8 s9) (ADD s284 s285 s286 s287 s288 s289 s290 s291))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 546 ms.
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (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 56 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-06 finished in 7796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((p1||G(F(p1))))))'
Support contains 9 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 986/986 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 570 transition count 978
Applied a total of 16 rules in 20 ms. Remains 570 /578 variables (removed 8) and now considering 978/986 (removed 8) transitions.
[2023-03-14 23:23:42] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:42] [INFO ] Invariant cache hit.
[2023-03-14 23:23:43] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
[2023-03-14 23:23:43] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:43] [INFO ] Invariant cache hit.
[2023-03-14 23:23:43] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-14 23:23:43] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:43] [INFO ] Invariant cache hit.
[2023-03-14 23:23:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:23:48] [INFO ] Implicit Places using invariants and state equation in 5087 ms returned []
Implicit Place search using SMT with State Equation took 5418 ms to find 0 implicit places.
[2023-03-14 23:23:48] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:48] [INFO ] Invariant cache hit.
[2023-03-14 23:23:49] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/578 places, 978/986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6273 ms. Remains : 570/578 places, 978/986 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ 2 (ADD s410 s411 s412 s413 s414 s415 s416 s417))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1970 reset in 263 ms.
Stuttering criterion allowed to conclude after 12261 steps with 216 reset in 37 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-07 finished in 6856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 9 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 986/986 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 570 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 570 transition count 978
Applied a total of 16 rules in 18 ms. Remains 570 /578 variables (removed 8) and now considering 978/986 (removed 8) transitions.
[2023-03-14 23:23:49] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:49] [INFO ] Invariant cache hit.
[2023-03-14 23:23:50] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
[2023-03-14 23:23:50] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:50] [INFO ] Invariant cache hit.
[2023-03-14 23:23:50] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-14 23:23:50] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:50] [INFO ] Invariant cache hit.
[2023-03-14 23:23:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:23:55] [INFO ] Implicit Places using invariants and state equation in 4855 ms returned []
Implicit Place search using SMT with State Equation took 5187 ms to find 0 implicit places.
[2023-03-14 23:23:55] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:55] [INFO ] Invariant cache hit.
[2023-03-14 23:23:55] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/578 places, 978/986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6022 ms. Remains : 570/578 places, 978/986 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s492), p1:(LEQ 1 (ADD s2 s3 s4 s5 s6 s7 s8 s9))], 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 8588 reset in 298 ms.
Product exploration explored 100000 steps with 8630 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-14 23:23:56] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-14 23:23:56] [INFO ] Invariant cache hit.
[2023-03-14 23:23:57] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-14 23:23:57] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 103 ms returned sat
[2023-03-14 23:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:23:58] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2023-03-14 23:23:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:23:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-14 23:23:58] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 46 ms returned sat
[2023-03-14 23:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:23:59] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2023-03-14 23:23:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:24:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 686 ms returned sat
[2023-03-14 23:24:00] [INFO ] Computed and/alt/rep : 696/2557/688 causal constraints (skipped 272 transitions) in 48 ms.
[2023-03-14 23:24:06] [INFO ] Added : 394 causal constraints over 79 iterations in 6562 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 9 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 978/978 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 570 transition count 922
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 514 transition count 922
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 514 transition count 858
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 450 transition count 858
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 368 place count 386 transition count 794
Applied a total of 368 rules in 41 ms. Remains 386 /570 variables (removed 184) and now considering 794/978 (removed 184) transitions.
[2023-03-14 23:24:06] [INFO ] Flow matrix only has 778 transitions (discarded 16 similar events)
// Phase 1: matrix 778 rows 386 cols
[2023-03-14 23:24:06] [INFO ] Computed 40 place invariants in 9 ms
[2023-03-14 23:24:07] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
[2023-03-14 23:24:07] [INFO ] Flow matrix only has 778 transitions (discarded 16 similar events)
[2023-03-14 23:24:07] [INFO ] Invariant cache hit.
[2023-03-14 23:24:07] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-14 23:24:07] [INFO ] Flow matrix only has 778 transitions (discarded 16 similar events)
[2023-03-14 23:24:07] [INFO ] Invariant cache hit.
[2023-03-14 23:24:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:24:10] [INFO ] Implicit Places using invariants and state equation in 3443 ms returned []
Implicit Place search using SMT with State Equation took 3733 ms to find 0 implicit places.
[2023-03-14 23:24:10] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 23:24:10] [INFO ] Flow matrix only has 778 transitions (discarded 16 similar events)
[2023-03-14 23:24:10] [INFO ] Invariant cache hit.
[2023-03-14 23:24:11] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 386/570 places, 794/978 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4445 ms. Remains : 386/570 places, 794/978 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-14 23:24:11] [INFO ] Flow matrix only has 778 transitions (discarded 16 similar events)
[2023-03-14 23:24:11] [INFO ] Invariant cache hit.
[2023-03-14 23:24:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-14 23:24:12] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 44 ms returned sat
[2023-03-14 23:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:24:12] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2023-03-14 23:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:24:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-14 23:24:13] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 42 ms returned sat
[2023-03-14 23:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:24:14] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2023-03-14 23:24:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:24:14] [INFO ] [Nat]Added 96 Read/Feed constraints in 283 ms returned sat
[2023-03-14 23:24:14] [INFO ] Computed and/alt/rep : 360/1293/352 causal constraints (skipped 424 transitions) in 40 ms.
[2023-03-14 23:24:15] [INFO ] Added : 101 causal constraints over 21 iterations in 1199 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9724 reset in 254 ms.
Product exploration explored 100000 steps with 9724 reset in 271 ms.
Built C files in :
/tmp/ltsmin8675109025096207301
[2023-03-14 23:24:16] [INFO ] Computing symmetric may disable matrix : 794 transitions.
[2023-03-14 23:24:16] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 23:24:16] [INFO ] Computing symmetric may enable matrix : 794 transitions.
[2023-03-14 23:24:16] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 23:24:16] [INFO ] Computing Do-Not-Accords matrix : 794 transitions.
[2023-03-14 23:24:16] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 23:24:16] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8675109025096207301
Running compilation step : cd /tmp/ltsmin8675109025096207301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2119 ms.
Running link step : cd /tmp/ltsmin8675109025096207301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8675109025096207301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18044728887809901265.hoa' '--buchi-type=spotba'
LTSmin run took 6838 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-13 finished in 35723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)&&p0) U G(p2)))'
Support contains 42 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 986/986 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 578 transition count 946
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 538 transition count 938
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 530 transition count 938
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 96 place count 530 transition count 882
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 208 place count 474 transition count 882
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 320 place count 418 transition count 826
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 410 transition count 818
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 410 transition count 818
Applied a total of 336 rules in 52 ms. Remains 410 /578 variables (removed 168) and now considering 818/986 (removed 168) transitions.
[2023-03-14 23:24:25] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
// Phase 1: matrix 802 rows 410 cols
[2023-03-14 23:24:25] [INFO ] Computed 40 place invariants in 18 ms
[2023-03-14 23:24:25] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
[2023-03-14 23:24:25] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2023-03-14 23:24:25] [INFO ] Invariant cache hit.
[2023-03-14 23:24:26] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-14 23:24:26] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2023-03-14 23:24:26] [INFO ] Invariant cache hit.
[2023-03-14 23:24:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-14 23:24:28] [INFO ] Implicit Places using invariants and state equation in 2618 ms returned []
Implicit Place search using SMT with State Equation took 2909 ms to find 0 implicit places.
[2023-03-14 23:24:28] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 23:24:28] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2023-03-14 23:24:28] [INFO ] Invariant cache hit.
[2023-03-14 23:24:28] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/578 places, 818/986 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3674 ms. Remains : 410/578 places, 818/986 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s130 s131 s132 s133 s134 s135 s136 s137) (ADD s372 s373 s374 s375 s376 s377 s378 s379)), p0:(AND (LEQ (ADD s130 s131 s132 s133 s134 s135 s136...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-15 finished in 3810 ms.
All properties solved by simple procedures.
Total runtime 109901 ms.

BK_STOP 1678836270163

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T08"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T08, 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 r293-tall-167873945300355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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