Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 37K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620990088628

Running Version 0
[2021-05-14 11:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 11:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 11:01:42] [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.
[2021-05-14 11:01:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 11:01:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2021-05-14 11:01:43] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 11:01:43] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 4 ms.
[2021-05-14 11:01:43] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12084869443967826284.dot
[2021-05-14 11:01:43] [INFO ] Initial state test concluded for 3 properties.
FORMULA PermAdmissibility-COL-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100005 steps, including 564 resets, run finished after 116 ms. (steps per millisecond=862 ) properties (out of 27) seen :24
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 11:01:43] [INFO ] Computed 24 place invariants in 5 ms
[2021-05-14 11:01:43] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 2 ms returned unsat
[2021-05-14 11:01:43] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 2 ms returned unsat
[2021-05-14 11:01:43] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2021-05-14 11:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:01:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:01:43] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:01:43] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2021-05-14 11:01:43] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 11:01:43] [INFO ] Flatten gal took : 21 ms
FORMULA PermAdmissibility-COL-10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 11:01:43] [INFO ] Flatten gal took : 6 ms
[2021-05-14 11:01:43] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 11 ms.
[2021-05-14 11:01:43] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_5377613895550542668.dot
[2021-05-14 11:01:43] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 432 transitions.
Support contains 107 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 152 transition count 592
Applied a total of 16 rules in 23 ms. Remains 152 /168 variables (removed 16) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 11:01:43] [INFO ] Computed 22 place invariants in 23 ms
[2021-05-14 11:01:43] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 11:01:43] [INFO ] Computed 22 place invariants in 14 ms
[2021-05-14 11:01:44] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 11:01:44] [INFO ] Computed 22 place invariants in 10 ms
[2021-05-14 11:01:44] [INFO ] Dead Transitions using invariants and state equation in 301 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/168 places, 592/592 transitions.
[2021-05-14 11:01:44] [INFO ] Flatten gal took : 82 ms
[2021-05-14 11:01:44] [INFO ] Flatten gal took : 62 ms
[2021-05-14 11:01:44] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 100006 steps, including 563 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 22) seen :20
Running SMT prover for 2 properties.
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 11:01:44] [INFO ] Computed 22 place invariants in 7 ms
[2021-05-14 11:01:44] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 7 ms returned unsat
[2021-05-14 11:01:44] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0)) U G((p1||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 112 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 61 place count 91 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 96 place count 77 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 110 place count 77 transition count 228
Applied a total of 110 rules in 23 ms. Remains 77 /152 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 11:01:56] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 11:01:56] [INFO ] Implicit Places using invariants in 76 ms returned [4, 13, 62, 63, 64]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 11:01:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:01:56] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 72/152 places, 228/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 11:01:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:01:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/152 places, 228/592 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71) s22), p0:(AND (GT (ADD s64 s65 s66 s67 s68 s69 s70 s71) s22) (OR (GT 3 s24) (LEQ 3 s24)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1157 reset in 636 ms.
Product exploration explored 100000 steps with 1153 reset in 582 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1161 reset in 522 ms.
Product exploration explored 100000 steps with 1149 reset in 539 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 10 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 72/72 places, 228/228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 72 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 70 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 70 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 8 rules in 21 ms. Remains 70 /72 variables (removed 2) and now considering 226/228 (removed 2) transitions.
[2021-05-14 11:01:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 226 rows 70 cols
[2021-05-14 11:01:59] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 11:02:00] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/72 places, 226/228 transitions.
Product exploration explored 100000 steps with 1158 reset in 579 ms.
Product exploration explored 100000 steps with 1158 reset in 622 ms.
[2021-05-14 11:02:01] [INFO ] Flatten gal took : 17 ms
[2021-05-14 11:02:01] [INFO ] Flatten gal took : 17 ms
[2021-05-14 11:02:01] [INFO ] Time to serialize gal into /tmp/LTL12038066522874048199.gal : 3 ms
[2021-05-14 11:02:01] [INFO ] Time to serialize properties into /tmp/LTL12302751315796717418.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12038066522874048199.gal, -t, CGAL, -LTL, /tmp/LTL12302751315796717418.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12038066522874048199.gal -t CGAL -LTL /tmp/LTL12302751315796717418.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7)>c5_0)&&((c7_0<3)||(c7_0>=3)))")))U(G(("((((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7)<=c5_0)")||(X("((((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7)<=c5_0)"))))))
Formula 0 simplified : !(XF"(((((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7)>c5_0)&&((c7_0<3)||(c7_0>=3)))" U G("((((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7)<=c5_0)" | X"((((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7)<=c5_0)"))
Detected timeout of ITS tools.
[2021-05-14 11:02:16] [INFO ] Flatten gal took : 20 ms
[2021-05-14 11:02:16] [INFO ] Applying decomposition
[2021-05-14 11:02:16] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4730733072378238948.txt, -o, /tmp/graph4730733072378238948.bin, -w, /tmp/graph4730733072378238948.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4730733072378238948.bin, -l, -1, -v, -w, /tmp/graph4730733072378238948.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:02:16] [INFO ] Decomposing Gal with order
[2021-05-14 11:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:02:16] [INFO ] Removed a total of 43 redundant transitions.
[2021-05-14 11:02:16] [INFO ] Flatten gal took : 39 ms
[2021-05-14 11:02:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2021-05-14 11:02:16] [INFO ] Time to serialize gal into /tmp/LTL4817660419658771905.gal : 6 ms
[2021-05-14 11:02:16] [INFO ] Time to serialize properties into /tmp/LTL4278666752925549966.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4817660419658771905.gal, -t, CGAL, -LTL, /tmp/LTL4278666752925549966.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4817660419658771905.gal -t CGAL -LTL /tmp/LTL4278666752925549966.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((gu5.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7)>gu5.c5_0)&&((gi0.gu1.c7_0<3)||(gi0.gu1.c7_0>=3)))")))U(G(("((((((((gu5.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7)<=gu5.c5_0)")||(X("((((((((gu5.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7)<=gu5.c5_0)"))))))
Formula 0 simplified : !(XF"(((((((((gu5.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7)>gu5.c5_0)&&((gi0.gu1.c7_0<3)||(gi0.gu1.c7_0>=3)))" U G("((((((((gu5.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7)<=gu5.c5_0)" | X"((((((((gu5.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7)<=gu5.c5_0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17858969981430780264
[2021-05-14 11:02:32] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17858969981430780264
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17858969981430780264]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17858969981430780264] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17858969981430780264] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property PermAdmissibility-COL-10-00 finished in 48158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 69 place count 83 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 90 place count 83 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 104 place count 69 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 69 transition count 228
Applied a total of 118 rules in 28 ms. Remains 69 /152 variables (removed 83) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 69 cols
[2021-05-14 11:02:33] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 11:02:33] [INFO ] Implicit Places using invariants in 65 ms returned [12, 21, 54, 55, 64]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 65 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 11:02:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 11:02:33] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 64/152 places, 228/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 11:02:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 11:02:33] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/152 places, 228/592 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s52 s53 s54 s55 s56 s57 s58 s59) s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-01 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0||(G(p1) U X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 19 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 120 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 53 place count 99 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 74 place count 99 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 88 place count 85 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 102 place count 85 transition count 228
Applied a total of 102 rules in 8 ms. Remains 85 /152 variables (removed 67) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 85 cols
[2021-05-14 11:02:33] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-14 11:02:33] [INFO ] Implicit Places using invariants in 73 ms returned [4, 13, 54, 63, 64]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 80 cols
[2021-05-14 11:02:33] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 11:02:33] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 80/152 places, 228/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 80 cols
[2021-05-14 11:02:33] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 11:02:33] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/152 places, 228/592 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-10-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 (ADD s72 s73 s74 s75 s76 s77 s78 s79)), p1:(GT 1 (ADD s20 s21)), p2:(LEQ s48 (ADD s64 s65 s66 s67 s68 s69 s70 s71))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Product exploration explored 100000 steps with 25000 reset in 229 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 190 ms.
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1)]
Support contains 19 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 228/228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 80 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 78 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 78 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 8 rules in 14 ms. Remains 78 /80 variables (removed 2) and now considering 226/228 (removed 2) transitions.
[2021-05-14 11:02:35] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 226 rows 78 cols
[2021-05-14 11:02:35] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 11:02:35] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 78/80 places, 226/228 transitions.
Product exploration explored 100000 steps with 25000 reset in 188 ms.
Product exploration explored 100000 steps with 25000 reset in 196 ms.
[2021-05-14 11:02:36] [INFO ] Flatten gal took : 16 ms
[2021-05-14 11:02:36] [INFO ] Flatten gal took : 15 ms
[2021-05-14 11:02:36] [INFO ] Time to serialize gal into /tmp/LTL10125746902279912531.gal : 2 ms
[2021-05-14 11:02:36] [INFO ] Time to serialize properties into /tmp/LTL10758130120115907204.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10125746902279912531.gal, -t, CGAL, -LTL, /tmp/LTL10758130120115907204.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10125746902279912531.gal -t CGAL -LTL /tmp/LTL10758130120115907204.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((((((((out3_0+out3_1)+out3_2)+out3_3)+out3_4)+out3_5)+out3_6)+out3_7)<3)")||((G("((in1_0+in1_1)<1)"))U(X("(c9_0<=(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))"))))))))
Formula 0 simplified : !XXX("((((((((out3_0+out3_1)+out3_2)+out3_3)+out3_4)+out3_5)+out3_6)+out3_7)<3)" | (G"((in1_0+in1_1)<1)" U X"(c9_0<=(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))"))
Detected timeout of ITS tools.
[2021-05-14 11:02:51] [INFO ] Flatten gal took : 14 ms
[2021-05-14 11:02:51] [INFO ] Applying decomposition
[2021-05-14 11:02:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8697002047032184643.txt, -o, /tmp/graph8697002047032184643.bin, -w, /tmp/graph8697002047032184643.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8697002047032184643.bin, -l, -1, -v, -w, /tmp/graph8697002047032184643.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:02:51] [INFO ] Decomposing Gal with order
[2021-05-14 11:02:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:02:51] [INFO ] Removed a total of 48 redundant transitions.
[2021-05-14 11:02:51] [INFO ] Flatten gal took : 28 ms
[2021-05-14 11:02:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 4 ms.
[2021-05-14 11:02:51] [INFO ] Time to serialize gal into /tmp/LTL6990031822387849276.gal : 3 ms
[2021-05-14 11:02:51] [INFO ] Time to serialize properties into /tmp/LTL16390380579106023608.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6990031822387849276.gal, -t, CGAL, -LTL, /tmp/LTL16390380579106023608.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6990031822387849276.gal -t CGAL -LTL /tmp/LTL16390380579106023608.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((((((((gu6.out3_0+gu6.out3_1)+gu6.out3_2)+gu6.out3_3)+gu6.out3_4)+gu6.out3_5)+gu6.out3_6)+gu6.out3_7)<3)")||((G("((gu0.in1_0+gu0.in1_1)<1)"))U(X("(gu5.c9_0<=(((((((gu5.out1_0+gu5.out1_1)+gu5.out1_2)+gu5.out1_3)+gu5.out1_4)+gu5.out1_5)+gu5.out1_6)+gu5.out1_7))"))))))))
Formula 0 simplified : !XXX("((((((((gu6.out3_0+gu6.out3_1)+gu6.out3_2)+gu6.out3_3)+gu6.out3_4)+gu6.out3_5)+gu6.out3_6)+gu6.out3_7)<3)" | (G"((gu0.in1_0+gu0.in1_1)<1)" U X"(gu5.c9_0<=(((((((gu5.out1_0+gu5.out1_1)+gu5.out1_2)+gu5.out1_3)+gu5.out1_4)+gu5.out1_5)+gu5.out1_6)+gu5.out1_7))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4277081754381638920
[2021-05-14 11:03:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4277081754381638920
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4277081754381638920]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4277081754381638920] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4277081754381638920] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property PermAdmissibility-COL-10-04 finished in 33867 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F((!p0&&X(p1))))))))], workingDir=/home/mcc/execution]
Support contains 17 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 90 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 90 transition count 368
Applied a total of 76 rules in 16 ms. Remains 90 /152 variables (removed 62) and now considering 368/592 (removed 224) transitions.
// Phase 1: matrix 368 rows 90 cols
[2021-05-14 11:03:08] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 11:03:08] [INFO ] Implicit Places using invariants in 88 ms returned [76, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
// Phase 1: matrix 368 rows 88 cols
[2021-05-14 11:03:08] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 11:03:08] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Starting structural reductions, iteration 1 : 88/152 places, 368/592 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 368/368 (removed 0) transitions.
// Phase 1: matrix 368 rows 88 cols
[2021-05-14 11:03:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 11:03:08] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 88/152 places, 368/592 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s68 s69 s70 s71 s72 s73 s74 s75) s3), p1:(LEQ 1 (ADD s76 s77 s78 s79 s80 s81 s82 s83))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2505 reset in 608 ms.
Product exploration explored 100000 steps with 2504 reset in 645 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 368
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2484 reset in 621 ms.
Product exploration explored 100000 steps with 2507 reset in 639 ms.
[2021-05-14 11:03:11] [INFO ] Flatten gal took : 21 ms
[2021-05-14 11:03:11] [INFO ] Flatten gal took : 20 ms
[2021-05-14 11:03:11] [INFO ] Time to serialize gal into /tmp/LTL10145223607301193451.gal : 4 ms
[2021-05-14 11:03:12] [INFO ] Time to serialize properties into /tmp/LTL1113669811926933378.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10145223607301193451.gal, -t, CGAL, -LTL, /tmp/LTL1113669811926933378.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10145223607301193451.gal -t CGAL -LTL /tmp/LTL1113669811926933378.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)")||(X(F(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)>c13_0)")&&(X("((((((((aux13_0+aux13_1)+aux13_2)+aux13_3)+aux13_4)+aux13_5)+aux13_6)+aux13_7)>=1)")))))))))
Formula 0 simplified : !FG("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)" | XF("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)>c13_0)" & X"((((((((aux13_0+aux13_1)+aux13_2)+aux13_3)+aux13_4)+aux13_5)+aux13_6)+aux13_7)>=1)"))
Detected timeout of ITS tools.
[2021-05-14 11:03:27] [INFO ] Flatten gal took : 34 ms
[2021-05-14 11:03:27] [INFO ] Applying decomposition
[2021-05-14 11:03:27] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5601860983255917154.txt, -o, /tmp/graph5601860983255917154.bin, -w, /tmp/graph5601860983255917154.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5601860983255917154.bin, -l, -1, -v, -w, /tmp/graph5601860983255917154.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:03:27] [INFO ] Decomposing Gal with order
[2021-05-14 11:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:03:27] [INFO ] Removed a total of 191 redundant transitions.
[2021-05-14 11:03:27] [INFO ] Flatten gal took : 87 ms
[2021-05-14 11:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 23 ms.
[2021-05-14 11:03:27] [INFO ] Time to serialize gal into /tmp/LTL3024867133510992083.gal : 6 ms
[2021-05-14 11:03:27] [INFO ] Time to serialize properties into /tmp/LTL8828560373273912026.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3024867133510992083.gal, -t, CGAL, -LTL, /tmp/LTL8828560373273912026.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3024867133510992083.gal -t CGAL -LTL /tmp/LTL8828560373273912026.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((gu2.aux16_0+gu2.aux16_1)+gu2.aux16_2)+gu2.aux16_3)+gu2.aux16_4)+gu2.aux16_5)+gu2.aux16_6)+gu2.aux16_7)<=gu2.c13_0)")||(X(F(("((((((((gu2.aux16_0+gu2.aux16_1)+gu2.aux16_2)+gu2.aux16_3)+gu2.aux16_4)+gu2.aux16_5)+gu2.aux16_6)+gu2.aux16_7)>gu2.c13_0)")&&(X("((((((((gu3.aux13_0+gu3.aux13_1)+gu3.aux13_2)+gu3.aux13_3)+gu3.aux13_4)+gu3.aux13_5)+gu3.aux13_6)+gu3.aux13_7)>=1)")))))))))
Formula 0 simplified : !FG("((((((((gu2.aux16_0+gu2.aux16_1)+gu2.aux16_2)+gu2.aux16_3)+gu2.aux16_4)+gu2.aux16_5)+gu2.aux16_6)+gu2.aux16_7)<=gu2.c13_0)" | XF("((((((((gu2.aux16_0+gu2.aux16_1)+gu2.aux16_2)+gu2.aux16_3)+gu2.aux16_4)+gu2.aux16_5)+gu2.aux16_6)+gu2.aux16_7)>gu2.c13_0)" & X"((((((((gu3.aux13_0+gu3.aux13_1)+gu3.aux13_2)+gu3.aux13_3)+gu3.aux13_4)+gu3.aux13_5)+gu3.aux13_6)+gu3.aux13_7)>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4079335924184360924
[2021-05-14 11:03:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4079335924184360924
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4079335924184360924]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4079335924184360924] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4079335924184360924] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property PermAdmissibility-COL-10-07 finished in 35919 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(G(!p0)&&X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 76 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 104 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 132 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 160 place count 48 transition count 88
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 39 transition count 34
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 39 transition count 34
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 180 place count 37 transition count 28
Ensure Unique test removed 1 places
Iterating global reduction 1 with 3 rules applied. Total rules applied 183 place count 36 transition count 28
Applied a total of 183 rules in 5 ms. Remains 36 /152 variables (removed 116) and now considering 28/592 (removed 564) transitions.
// Phase 1: matrix 28 rows 36 cols
[2021-05-14 11:03:43] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 11:03:43] [INFO ] Implicit Places using invariants in 30 ms returned [4, 5, 6, 7, 16, 17, 18, 23, 28, 29, 30, 31]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 31 ms to find 12 implicit places.
// Phase 1: matrix 28 rows 24 cols
[2021-05-14 11:03:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 11:03:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 24/152 places, 28/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2021-05-14 11:03:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 11:03:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/152 places, 28/592 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-10-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GT 1 s16), p1:(OR (GT s0 s9) (GT 1 (ADD s12 s13 s14 s15)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 28
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (OR (G p1) (G (NOT p1)))), p0, p1]
Adopting property with smaller alphabet thanks to knowledge :(F (G p0))
Stuttering acceptance computed with spot in 88 ms :[false, false, p0, p0]
Support contains 1 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 24/24 places, 28/28 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 21 transition count 22
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 22
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 19 transition count 16
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 18 transition count 16
Applied a total of 11 rules in 0 ms. Remains 18 /24 variables (removed 6) and now considering 16/28 (removed 12) transitions.
// Phase 1: matrix 16 rows 18 cols
[2021-05-14 11:03:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 11:03:43] [INFO ] Implicit Places using invariants in 20 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:03:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:03:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 16/24 places, 16/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:03:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:03:44] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 16/24 places, 16/28 transitions.
Stuttering acceptance computed with spot in 87 ms :[false, false, p0, p0]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 86 ms :[false, false, p0, p0]
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 16 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 9 place count 16 transition count 16
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 16 transition count 16
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 23 place count 6 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 33 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 6 transition count 6
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 38 rules in 3 ms. Remains 4 /16 variables (removed 12) and now considering 4/16 (removed 12) transitions.
[2021-05-14 11:03:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 11:03:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:03:44] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/16 places, 4/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Starting structural reductions, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2021-05-14 11:03:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 11:03:44] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 28 rows 24 cols
[2021-05-14 11:03:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 11:03:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 24 cols
[2021-05-14 11:03:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 11:03:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 28/28 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620990226946

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-10"
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 PermAdmissibility-COL-10, 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 r140-tall-162089128000484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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