fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r120-blw7-149441651800096
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_IBMB2S565S3960-PT-none

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3471.000 131015.00 265024.00 153.10 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-blw7-149441651800096
=====================================================================

--------------------
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 IBMB2S565S3960-PT-none-LTLFireability-0
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-1
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-15
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-2
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-3
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-4
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-5
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-6
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-7
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-8
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496416088505


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G("decision.s00002762.activated>=1")))
Formula 0 simplified : !G"decision.s00002762.activated>=1"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 179 rows 273 cols
invariant : -1'callToProcess.s00003884.input.s00001052 + 1'callToProcess.s00003884.input.s00001068= 0
invariant : 1'fork.s00002755.activated.s00001073 + -1'fork.s00002755.activated.s00001075 + 1'join.s00001164.activated.s00001062 + -1'join.s00001164.activated.s00001064 + 1'join.s00001164.input.s00001052 + -1'join.s00001164.input.s00001127 + -1'merge.s00001162.input.s00001066 + 1'merge.s00001162.input.s00001843= 0
invariant : -1'callToTask.s00003976.output.s00001054 + 1'callToTask.s00003976.output.s00001077= 0
invariant : -1'callToTask.s00003968.output.s00001054 + 1'callToTask.s00003968.output.s00001080= 0
invariant : 1'callToTask.s00003977.input.s00001052 + 1'callToTask.s00003977.inputCriterion.s00001053.used + 1'callToTask.s00003977.output.s00001054 + 1'callToTask.s00003979.inputCriterion.s00001053.used + 1'callToTask.s00003979.output.s00001054 + -1'callToTask.s00003981.input.s00001052 + 1'callToTask.s00003981.input.s00001068 + 1'fork.s00001403.activated.s00001073 + -1'fork.s00001403.activated.s00001078 + 1'fork.s00002501.activated.s00001075= 0
invariant : -1'callToTask.s00003973.output.s00001054 + 1'callToTask.s00003973.output.s00001077= 0
invariant : -1'callToTask.s00003968.output.s00001054 + 1'callToTask.s00003968.output.s00001077= 0
invariant : -1'callToTask.s00003969.output.s00001054 + 1'callToTask.s00003969.output.s00001080= 0
invariant : -1'callToTask.s00003980.input.s00001052 + 1'callToTask.s00003980.input.s00001127= 0
invariant : -1'fork.s00002500.input.s00001052 + 1'fork.s00002500.input.s00001066= 0
invariant : -1'callToTask.s00003980.output.s00001077 + 1'callToTask.s00003980.output.s00001080= 0
invariant : -1'join.s00002243.input.s00001066 + 1'join.s00002243.input.s00001166= 0
invariant : -1'callToProcess.s00003859.output.s00001054 + 1'callToProcess.s00003859.output.s00001083= 0
invariant : 1'fork.s00002755.activated.s00001075 + -1'join.s00001164.activated.s00001062 + 1'join.s00001164.activated.s00001064 + -1'join.s00001164.input.s00001052 + 1'join.s00001164.input.s00001127 + 1'process.s00000565__s00003960.input.s00001052= 0
invariant : 7'alpha + 1'callToProcess.s00003859.input.s00001052 + 1'callToProcess.s00003859.inputCriterion.s00001053.used + 1'callToProcess.s00003859.output.s00001054 + -1'callToProcess.s00003880.output.s00001054 + 1'callToProcess.s00003880.output.s00001077 + 1'callToProcess.s00003904.input.s00001052 + 1'callToProcess.s00003904.inputCriterion.s00001053.used + 1'callToProcess.s00003904.output.s00001054 + 1'callToTask.s00003963.input.s00001052 + 1'callToTask.s00003963.inputCriterion.s00001053.used + 1'callToTask.s00003963.output.s00001054 + 1'callToTask.s00003975.input.s00001052 + 1'callToTask.s00003975.inputCriterion.s00001053.used + 1'callToTask.s00003975.output.s00001054 + 1'callToTask.s00003980.input.s00001052 + 1'callToTask.s00003980.inputCriterion.s00001053.used + 1'callToTask.s00003980.output.s00001054 + 1'decision.s00002760.activated + 1'decision.s00002761.activated + 1'endNode.s00001401.input.default + 1'endNode.s00001402.input.default + 1'fork.s00001071.activated.s00001073 + 1'join.s00001164.activated.s00001062 + 1'join.s00001164.input.s00001052 + 1'join.s00002243.activated.s00001065 + 1'join.s00002243.input.s00001068 + 1'merge.s00001162.activated + 1'merge.s00001162.input.s00001052 + 1'merge.s00001162.input.s00001066 + 1'merge.s00001162.input.s00001068 + 1'merge.s00001162.input.s00001127 + 1'merge.s00001162.input.s00001128 + 1'merge.s00001162.input.s00001129 + 1'merge.s00001162.input.s00001165 + 1'merge.s00002239.activated + 1'merge.s00002239.input.s00001052 + 1'merge.s00002239.input.s00001066 + 1'merge.s00002241.activated + 1'process.s00000565__s00003960.output.s00001249= 7
invariant : -1'callToProcess.s00003957.input.s00001052 + 1'callToProcess.s00003957.input.s00001068= 0
invariant : -1'callToTask.s00001360.output.s00001054 + 1'callToTask.s00001360.output.s00001077= 0
invariant : -1'callToTask.s00003977.output.s00001054 + 1'callToTask.s00003977.output.s00001077= 0
invariant : -1'callToTask.s00003969.input.s00001052 + 1'callToTask.s00003969.input.s00001066= 0
invariant : -1'callToTask.s00003975.input.s00001052 + 1'callToTask.s00003975.input.s00001127= 0
invariant : -1'callToTask.s00003972.output.s00001054 + 1'callToTask.s00003972.output.s00001077= 0
invariant : -1'callToProcess.s00003859.output.s00001054 + 1'callToProcess.s00003859.output.s00001077= 0
invariant : -1'callToTask.s00003979.output.s00001054 + 1'callToTask.s00003979.output.s00001077= 0
invariant : -1'callToTask.s00003971.output.s00001054 + 1'callToTask.s00003971.output.s00001077= 0
invariant : -1'callToTask.s00003980.output.s00001077 + 1'callToTask.s00003980.output.s00001083= 0
invariant : -1'callToTask.s00003908.output.s00001054 + 1'callToTask.s00003908.output.s00001083= 0
invariant : -1'join.s00002243.input.s00001052 + 1'join.s00002243.input.s00001127= 0
invariant : -1'merge.s00001162.input.s00001052 + 1'merge.s00001162.input.s00001166= 0
invariant : -1'callToTask.s00003981.output.s00001054 + 1'callToTask.s00003981.output.s00001077= 0
invariant : -1'callToTask.s00003972.input.s00001052 + 1'callToTask.s00003972.input.s00001066= 0
invariant : -1'merge.s00001160.input.s00001068 + 1'merge.s00001160.input.s00001165= 0
invariant : -1'callToTask.s00001360.inputCriterion.s00001053.used + -1'callToTask.s00001360.output.s00001054 + 1'callToTask.s00003977.input.s00001052 + 1'callToTask.s00003977.inputCriterion.s00001053.used + 1'callToTask.s00003977.output.s00001054 + 1'callToTask.s00003979.inputCriterion.s00001053.used + 1'callToTask.s00003979.output.s00001054 + -1'callToTask.s00003981.input.s00001052 + -1'callToTask.s00003981.inputCriterion.s00001053.used + -1'callToTask.s00003981.output.s00001054 + 1'fork.s00001403.activated.s00001073 + -1'fork.s00001403.activated.s00001078 + 1'fork.s00002501.activated.s00001073 + 1'join.s00001163.activated.s00001062 + -1'join.s00001163.activated.s00001065 + 1'join.s00001163.input.s00001259= 0
invariant : -1'callToProcess.s00003876.input.s00001052 + 1'callToProcess.s00003876.input.s00001068= 0
invariant : -1'callToTask.s00003975.output.s00001054 + 1'callToTask.s00003975.output.s00001080= 0
invariant : -1'callToTask.s00003908.input.s00001052 + 1'callToTask.s00003908.input.s00001066= 0
invariant : -1'callToTask.s00003962.output.s00001054 + 1'callToTask.s00003962.output.s00001080= 0
invariant : -1'merge.s00001061.input.s00001127 + 1'merge.s00001061.input.s00001166= 0
invariant : -1'callToProcess.s00003904.input.s00001052 + 1'callToProcess.s00003904.input.s00001066= 0
invariant : -1'callToTask.s00003970.input.s00001052 + 1'callToTask.s00003970.input.s00001068= 0
invariant : 1'callToProcess.s00003880.output.s00001054 + -1'callToProcess.s00003880.output.s00001077 + 1'process.s00000565__s00003960.outputCriterion.s00001055_omega= 0
invariant : -1'callToProcess.s00003859.output.s00001054 + 1'callToProcess.s00003859.output.s00001080= 0
invariant : -1'callToTask.s00003973.input.s00001052 + 1'callToTask.s00003973.input.s00001066= 0
invariant : -1'merge.s00001161.input.s00001052 + 1'merge.s00001161.input.s00001068= 0
invariant : -1'callToTask.s00003975.input.s00001052 + 1'callToTask.s00003975.input.s00001066= 0
invariant : -1'join.s00002243.input.s00001068 + 1'join.s00002243.input.s00001263= 0
invariant : -1'callToTask.s00003908.output.s00001054 + 1'callToTask.s00003908.output.s00001077= 0
invariant : -1'merge.s00001161.input.s00001052 + 1'merge.s00001161.input.s00001128= 0
invariant : -1'callToTask.s00003980.input.s00001052 + 1'callToTask.s00003980.input.s00001066= 0
invariant : -1'callToTask.s00001360.inputCriterion.s00001053.used + -1'callToTask.s00001360.output.s00001054 + 1'callToTask.s00003977.input.s00001052 + 1'callToTask.s00003977.inputCriterion.s00001053.used + 1'callToTask.s00003977.output.s00001054 + 1'callToTask.s00003979.inputCriterion.s00001053.used + 1'callToTask.s00003979.output.s00001054 + -1'callToTask.s00003981.input.s00001052 + -1'callToTask.s00003981.inputCriterion.s00001053.used + -1'callToTask.s00003981.output.s00001054 + 1'fork.s00001403.activated.s00001073 + -1'fork.s00001403.activated.s00001078 + 1'fork.s00002501.activated.s00001073 + 1'join.s00001163.activated.s00001062 + -1'join.s00001163.activated.s00001065 + 1'join.s00001163.input.s00001052= 0
invariant : -1'callToTask.s00003964.output.s00001054 + 1'callToTask.s00003964.output.s00001077= 0
invariant : -1'callToTask.s00003976.input.s00001052 + 1'callToTask.s00003976.input.s00001066= 0
invariant : -1'callToProcess.s00003876.output.s00001054 + 1'callToProcess.s00003876.output.s00001077= 0
invariant : 9'alpha + 2'callToProcess.s00001108.input.s00001066 + 2'callToProcess.s00001108.inputCriterion.s00001053.used + 2'callToProcess.s00001108.output.s00001077 + 1'callToProcess.s00003859.input.s00001052 + 1'callToProcess.s00003859.inputCriterion.s00001053.used + 1'callToProcess.s00003859.output.s00001054 + 1'callToProcess.s00003872.input.s00001052 + 1'callToProcess.s00003872.inputCriterion.s00001053.used + 1'callToProcess.s00003872.output.s00001054 + 1'callToProcess.s00003876.input.s00001052 + 1'callToProcess.s00003876.inputCriterion.s00001053.used + 1'callToProcess.s00003876.output.s00001054 + 1'callToProcess.s00003880.input.s00001052 + 1'callToProcess.s00003880.inputCriterion.s00001053.used + 1'callToProcess.s00003880.output.s00001077 + 1'callToProcess.s00003884.input.s00001052 + 1'callToProcess.s00003884.inputCriterion.s00001053.used + 1'callToProcess.s00003884.output.s00001054 + 1'callToProcess.s00003904.input.s00001052 + 1'callToProcess.s00003904.inputCriterion.s00001053.used + 1'callToProcess.s00003904.output.s00001054 + 1'callToProcess.s00003957.input.s00001052 + 1'callToProcess.s00003957.input.s00001066 + 2'callToProcess.s00003957.inputCriterion.s00001053.used + 2'callToProcess.s00003957.output.s00001077 + 1'callToTask.s00001360.inputCriterion.s00001053.used + 1'callToTask.s00001360.output.s00001054 + 1'callToTask.s00003908.input.s00001052 + 1'callToTask.s00003908.inputCriterion.s00001053.used + 1'callToTask.s00003908.output.s00001054 + 1'callToTask.s00003913.input.s00001052 + 1'callToTask.s00003913.inputCriterion.s00001053.used + 1'callToTask.s00003913.output.s00001054 + 2'callToTask.s00003961.inputCriterion.s00001053.used + 2'callToTask.s00003961.output.s00001080 + 1'callToTask.s00003962.input.s00001052 + 1'callToTask.s00003962.inputCriterion.s00001053.used + 1'callToTask.s00003962.output.s00001054 + 2'callToTask.s00003965.input.s00001052 + 2'callToTask.s00003965.inputCriterion.s00001053.used + 2'callToTask.s00003965.output.s00001054 + 1'callToTask.s00003966.input.s00001052 + 1'callToTask.s00003966.inputCriterion.s00001053.used + 1'callToTask.s00003966.output.s00001054 + 1'callToTask.s00003968.inputCriterion.s00001053.used + 1'callToTask.s00003968.output.s00001054 + 1'callToTask.s00003969.input.s00001052 + 1'callToTask.s00003969.inputCriterion.s00001053.used + 1'callToTask.s00003969.output.s00001054 + 1'callToTask.s00003970.input.s00001052 + 1'callToTask.s00003970.inputCriterion.s00001053.used + 1'callToTask.s00003970.output.s00001054 + 1'callToTask.s00003971.input.s00001052 + 1'callToTask.s00003971.inputCriterion.s00001053.used + 1'callToTask.s00003971.output.s00001054 + 1'callToTask.s00003972.input.s00001052 + 1'callToTask.s00003972.inputCriterion.s00001053.used + 1'callToTask.s00003972.output.s00001054 + 1'callToTask.s00003973.input.s00001052 + 1'callToTask.s00003973.inputCriterion.s00001053.used + 1'callToTask.s00003973.output.s00001054 + 1'callToTask.s00003974.inputCriterion.s00001053.used + 1'callToTask.s00003974.output.s00001054 + 1'callToTask.s00003976.input.s00001052 + 1'callToTask.s00003976.inputCriterion.s00001053.used + 1'callToTask.s00003976.output.s00001054 + 1'callToTask.s00003978.inputCriterion.s00001053.used + 1'callToTask.s00003978.output.s00001077 + 1'callToTask.s00003980.input.s00001052 + 1'callToTask.s00003980.inputCriterion.s00001053.used + 1'callToTask.s00003980.output.s00001077 + 1'callToTask.s00003981.input.s00001052 + 1'callToTask.s00003981.inputCriterion.s00001053.used + 1'callToTask.s00003981.output.s00001054 + 1'decision.s00001123.activated + 1'decision.s00001126.activated + 1'decision.s00001157.activated + 1'decision.s00001158.activated + 1'decision.s00001159.activated + 1'decision.s00001840.activated + 1'decision.s00001841.activated + 1'decision.s00002055.activated + 1'decision.s00002056.activated + 1'decision.s00002760.activated + 2'decision.s00002762.activated + 1'decision.s00002948.activated + 1'decision.s00003020.activated + 1'decision.s00003021.activated + 1'endNode.s00001401.input.default + 1'endNode.s00001402.input.default + 1'endNode.s00002053.input.default + 1'fork.s00001071.activated.s00001075 + 1'fork.s00001298.activated.s00001073 + 1'fork.s00001298.input.s00001052 + 1'fork.s00001403.activated.s00001078 + 1'fork.s00001403.input.s00001052 + 1'fork.s00002500.activated.s00001073 + 1'fork.s00002500.input.s00001052 + 1'join.s00001163.activated.s00001065 + 1'join.s00001164.activated.s00001062 + 1'join.s00001164.input.s00001052 + 1'join.s00002243.activated.s00001062 + 1'join.s00002243.input.s00001052 + 1'merge.s00001061.activated + 1'merge.s00001061.input.s00001052 + 1'merge.s00001061.input.s00001066 + 1'merge.s00001061.input.s00001068 + 1'merge.s00001061.input.s00001127 + 1'merge.s00001160.activated + 1'merge.s00001160.input.s00001052 + 1'merge.s00001160.input.s00001066 + 1'merge.s00001160.input.s00001068 + 1'merge.s00001160.input.s00001127 + 1'merge.s00001161.activated + 1'merge.s00001161.input.s00001052 + 1'merge.s00001161.input.s00001066 + 1'merge.s00001162.activated + 1'merge.s00001162.input.s00001052 + 1'merge.s00001162.input.s00001066 + 1'merge.s00001162.input.s00001068 + 1'merge.s00001162.input.s00001127 + 1'merge.s00001162.input.s00001128 + 1'merge.s00001162.input.s00001129 + 1'merge.s00001162.input.s00001165 + 1'merge.s00002238.activated + 1'merge.s00002238.input.s00001052 + 1'merge.s00002238.input.s00001066 + 1'merge.s00002239.activated + 1'merge.s00002239.input.s00001052 + 1'merge.s00002239.input.s00001066 + 1'merge.s00002240.activated + 1'merge.s00002240.input.s00001052 + 1'merge.s00002240.input.s00001066 + 1'merge.s00002240.input.s00001129= 9
invariant : -1'callToTask.s00003974.output.s00001054 + 1'callToTask.s00003974.output.s00001077= 0
invariant : -1'callToTask.s00003969.output.s00001054 + 1'callToTask.s00003969.output.s00001077= 0
invariant : -1'join.s00001164.activated.s00001062 + 1'join.s00001164.activated.s00001064 + -1'join.s00001164.input.s00001052 + 1'join.s00001164.input.s00001066= 0
invariant : -1'merge.s00001161.input.s00001066 + 1'merge.s00001161.input.s00001129= 0
invariant : -1'callToProcess.s00003957.output.s00001077 + 1'callToProcess.s00003957.output.s00001080= 0
invariant : -1'callToTask.s00003962.input.s00001052 + 1'callToTask.s00003962.input.s00001066= 0
invariant : -1'callToProcess.s00003884.input.s00001052 + 1'callToProcess.s00003884.input.s00001127= 0
invariant : -1'callToTask.s00003978.output.s00001077 + 1'callToTask.s00003978.output.s00001080= 0
invariant : -1'merge.s00001160.input.s00001127 + 1'merge.s00001160.input.s00001166= 0
invariant : -1'callToTask.s00003913.input.s00001052 + 1'callToTask.s00003913.input.s00001066= 0
invariant : 9'alpha + 2'callToProcess.s00001108.input.s00001066 + 2'callToProcess.s00001108.inputCriterion.s00001053.used + 2'callToProcess.s00001108.output.s00001077 + 1'callToProcess.s00003859.input.s00001052 + 1'callToProcess.s00003859.inputCriterion.s00001053.used + 1'callToProcess.s00003859.output.s00001054 + 1'callToProcess.s00003872.input.s00001052 + 1'callToProcess.s00003872.inputCriterion.s00001053.used + 1'callToProcess.s00003872.output.s00001054 + 1'callToProcess.s00003876.input.s00001052 + 1'callToProcess.s00003876.inputCriterion.s00001053.used + 1'callToProcess.s00003876.output.s00001054 + 1'callToProcess.s00003880.input.s00001052 + 1'callToProcess.s00003880.inputCriterion.s00001053.used + 1'callToProcess.s00003880.output.s00001077 + 1'callToProcess.s00003884.input.s00001052 + 1'callToProcess.s00003884.inputCriterion.s00001053.used + 1'callToProcess.s00003884.output.s00001054 + 1'callToProcess.s00003904.input.s00001052 + 1'callToProcess.s00003904.inputCriterion.s00001053.used + 1'callToProcess.s00003904.output.s00001054 + 1'callToProcess.s00003957.input.s00001052 + 1'callToProcess.s00003957.input.s00001066 + 2'callToProcess.s00003957.inputCriterion.s00001053.used + 2'callToProcess.s00003957.output.s00001077 + 1'callToTask.s00001360.inputCriterion.s00001053.used + 1'callToTask.s00001360.output.s00001054 + 1'callToTask.s00003908.input.s00001052 + 1'callToTask.s00003908.inputCriterion.s00001053.used + 1'callToTask.s00003908.output.s00001054 + 1'callToTask.s00003913.input.s00001052 + 1'callToTask.s00003913.inputCriterion.s00001053.used + 1'callToTask.s00003913.output.s00001054 + 2'callToTask.s00003961.inputCriterion.s00001053.used + 2'callToTask.s00003961.output.s00001080 + 1'callToTask.s00003962.input.s00001052 + 1'callToTask.s00003962.inputCriterion.s00001053.used + 1'callToTask.s00003962.output.s00001054 + 2'callToTask.s00003965.input.s00001052 + 2'callToTask.s00003965.inputCriterion.s00001053.used + 2'callToTask.s00003965.output.s00001054 + 1'callToTask.s00003966.input.s00001052 + 1'callToTask.s00003966.inputCriterion.s00001053.used + 1'callToTask.s00003966.output.s00001054 + 1'callToTask.s00003968.inputCriterion.s00001053.used + 1'callToTask.s00003968.output.s00001054 + 1'callToTask.s00003969.input.s00001052 + 1'callToTask.s00003969.inputCriterion.s00001053.used + 1'callToTask.s00003969.output.s00001054 + 1'callToTask.s00003970.input.s00001052 + 1'callToTask.s00003970.inputCriterion.s00001053.used + 1'callToTask.s00003970.output.s00001054 + 1'callToTask.s00003971.input.s00001052 + 1'callToTask.s00003971.inputCriterion.s00001053.used + 1'callToTask.s00003971.output.s00001054 + 1'callToTask.s00003972.input.s00001052 + 1'callToTask.s00003972.inputCriterion.s00001053.used + 1'callToTask.s00003972.output.s00001054 + 1'callToTask.s00003973.input.s00001052 + 1'callToTask.s00003973.inputCriterion.s00001053.used + 1'callToTask.s00003973.output.s00001054 + 1'callToTask.s00003974.inputCriterion.s00001053.used + 1'callToTask.s00003974.output.s00001054 + 1'callToTask.s00003976.input.s00001052 + 1'callToTask.s00003976.inputCriterion.s00001053.used + 1'callToTask.s00003976.output.s00001054 + 1'callToTask.s00003978.inputCriterion.s00001053.used + 1'callToTask.s00003978.output.s00001077 + 1'callToTask.s00003980.input.s00001052 + 1'callToTask.s00003980.inputCriterion.s00001053.used + 1'callToTask.s00003980.output.s00001077 + 1'callToTask.s00003981.input.s00001052 + 1'callToTask.s00003981.inputCriterion.s00001053.used + 1'callToTask.s00003981.output.s00001054 + 1'decision.s00001123.activated + 1'decision.s00001126.activated + 1'decision.s00001157.activated + 1'decision.s00001158.activated + 1'decision.s00001159.activated + 1'decision.s00001840.activated + 1'decision.s00001841.activated + 1'decision.s00002055.activated + 1'decision.s00002056.activated + 1'decision.s00002760.activated + 2'decision.s00002762.activated + 1'decision.s00002948.activated + 1'decision.s00003020.activated + 1'decision.s00003021.activated + 1'endNode.s00001401.input.default + 1'endNode.s00001402.input.default + 1'endNode.s00002053.input.default + 1'fork.s00001071.activated.s00001075 + 1'fork.s00001298.activated.s00001073 + 1'fork.s00001298.input.s00001052 + 1'fork.s00001403.activated.s00001078 + 1'fork.s00001403.input.s00001052 + 1'fork.s00002500.activated.s00001073 + 1'fork.s00002500.input.s00001052 + 1'join.s00001163.activated.s00001065 + 1'join.s00001164.activated.s00001062 + 1'join.s00001164.input.s00001052 + 1'join.s00002243.activated.s00001062 + 1'join.s00002243.input.s00001052 + 1'merge.s00001061.activated + 1'merge.s00001061.input.s00001052 + 1'merge.s00001061.input.s00001066 + 1'merge.s00001061.input.s00001068 + 1'merge.s00001061.input.s00001127 + 1'merge.s00001160.activated + 1'merge.s00001160.input.s00001052 + 1'merge.s00001160.input.s00001066 + 1'merge.s00001160.input.s00001068 + 1'merge.s00001160.input.s00001127 + 1'merge.s00001161.activated + 1'merge.s00001161.input.s00001052 + 1'merge.s00001161.input.s00001066 + 1'merge.s00001162.activated + 1'merge.s00001162.input.s00001052 + 1'merge.s00001162.input.s00001066 + 1'merge.s00001162.input.s00001068 + 1'merge.s00001162.input.s00001127 + 1'merge.s00001162.input.s00001128 + 1'merge.s00001162.input.s00001129 + 1'merge.s00001162.input.s00001165 + 1'merge.s00002238.activated + 1'merge.s00002238.input.s00001052 + 1'merge.s00002238.input.s00001066 + 1'merge.s00002239.activated + 1'merge.s00002239.input.s00001052 + 1'merge.s00002239.input.s00001066 + 1'merge.s00002240.activated + 1'merge.s00002240.input.s00001052 + 1'merge.s00002240.input.s00001066 + 1'merge.s00002240.input.s00001068= 9
invariant : -1'fork.s00001298.input.s00001052 + 1'fork.s00001298.input.s00001068= 0
invariant : -1'callToTask.s00003970.output.s00001054 + 1'callToTask.s00003970.output.s00001077= 0
invariant : -1'merge.s00002239.input.s00001052 + 1'merge.s00002239.input.s00001068= 0
invariant : -1'callToTask.s00001360.inputCriterion.s00001053.used + -1'callToTask.s00001360.output.s00001054 + -1'callToTask.s00003981.input.s00001052 + -1'callToTask.s00003981.inputCriterion.s00001053.used + -1'callToTask.s00003981.output.s00001054 + 1'fork.s00001403.activated.s00001075 + -1'fork.s00001403.activated.s00001078 + 1'join.s00001163.activated.s00001064 + -1'join.s00001163.activated.s00001065 + 1'join.s00001163.input.s00001066= 0
invariant : -1'callToProcess.s00003859.input.s00001052 + 1'callToProcess.s00003859.input.s00001068= 0
invariant : -1'callToProcess.s00003880.input.s00001052 + 1'callToProcess.s00003880.input.s00001066= 0
invariant : -1'merge.s00002240.input.s00001052 + 1'merge.s00002240.input.s00001127= 0
invariant : -1'callToTask.s00003965.input.s00001052 + 1'callToTask.s00003965.input.s00001066= 0
invariant : -1'join.s00002243.input.s00001068 + 1'join.s00002243.input.s00001167= 0
invariant : -1'callToTask.s00003981.input.s00001052 + 1'callToTask.s00003981.input.s00001066= 0
invariant : -1'callToProcess.s00003884.output.s00001054 + 1'callToProcess.s00003884.output.s00001083= 0
invariant : -1'callToTask.s00003975.output.s00001054 + 1'callToTask.s00003975.output.s00001077= 0
invariant : -1'callToTask.s00003913.output.s00001054 + 1'callToTask.s00003913.output.s00001077= 0
invariant : -1'callToProcess.s00003872.output.s00001054 + 1'callToProcess.s00003872.output.s00001077= 0
invariant : -1'callToTask.s00003971.input.s00001052 + 1'callToTask.s00003971.input.s00001066= 0
invariant : -1'callToTask.s00003973.input.s00001052 + 1'callToTask.s00003973.input.s00001068= 0
invariant : -1'callToTask.s00003962.input.s00001052 + 1'callToTask.s00003962.input.s00001068= 0
invariant : -1'callToTask.s00003965.output.s00001054 + 1'callToTask.s00003965.output.s00001077= 0
invariant : -1'callToProcess.s00003872.input.s00001052 + 1'callToProcess.s00003872.input.s00001066= 0
invariant : -1'callToTask.s00003977.input.s00001052 + 1'callToTask.s00003977.input.s00001066= 0
invariant : -1'fork.s00001298.input.s00001052 + 1'fork.s00001298.input.s00001066= 0
invariant : -1'callToProcess.s00003859.input.s00001052 + 1'callToProcess.s00003859.input.s00001066= 0
invariant : -1'callToTask.s00003975.input.s00001052 + 1'callToTask.s00003975.input.s00001068= 0
invariant : -1'merge.s00001061.input.s00001068 + 1'merge.s00001061.input.s00001165= 0
invariant : -1'callToTask.s00001360.inputCriterion.s00001053.used + -1'callToTask.s00001360.output.s00001054 + -1'callToTask.s00003981.input.s00001052 + -1'callToTask.s00003981.inputCriterion.s00001053.used + -1'callToTask.s00003981.output.s00001054 + 1'fork.s00001403.activated.s00001075 + -1'fork.s00001403.activated.s00001078 + 1'join.s00001163.activated.s00001064 + -1'join.s00001163.activated.s00001065 + 1'join.s00001163.input.s00001128= 0
invariant : -1'callToTask.s00003980.input.s00001052 + 1'callToTask.s00003980.input.s00001068= 0
invariant : -1'callToTask.s00003961.inputCriterion.s00001053.used + -1'callToTask.s00003961.output.s00001080 + 1'callToTask.s00003964.input.s00001052 + 1'callToTask.s00003964.inputCriterion.s00001053.used + 1'callToTask.s00003964.output.s00001054 + -1'callToTask.s00003965.input.s00001052 + -1'callToTask.s00003965.inputCriterion.s00001053.used + -1'callToTask.s00003965.output.s00001054 + 1'callToTask.s00003967.inputCriterion.s00001053.used + 1'callToTask.s00003967.output.s00001054= 0
invariant : -1'callToTask.s00003962.output.s00001054 + 1'callToTask.s00003962.output.s00001077= 0
invariant : -1'callToTask.s00003964.input.s00001052 + 1'callToTask.s00003964.input.s00001066= 0
invariant : -1'callToTask.s00003963.input.s00001052 + 1'callToTask.s00003963.input.s00001066= 0
invariant : -1'callToTask.s00003966.input.s00001052 + 1'callToTask.s00003966.input.s00001068= 0
invariant : -1'callToProcess.s00003904.output.s00001054 + 1'callToProcess.s00003904.output.s00001077= 0
invariant : -1'callToProcess.s00003884.input.s00001052 + 1'callToProcess.s00003884.input.s00001066= 0
invariant : -1'callToTask.s00003970.input.s00001052 + 1'callToTask.s00003970.input.s00001066= 0
invariant : -1'merge.s00001162.input.s00001129 + 1'merge.s00001162.input.s00001299= 0
invariant : -1'fork.s00001403.input.s00001052 + 1'fork.s00001403.input.s00001066= 0
invariant : -1'merge.s00001161.input.s00001066 + 1'merge.s00001161.input.s00001127= 0
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-0 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-1 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-2 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-3 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-4 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-5 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-6 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-7 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-8 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-9 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496416219520

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 3:08:09 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 3:08:09 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 63 ms
Jun 02, 2017 3:08:09 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 273 places.
Jun 02, 2017 3:08:10 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 179 transitions.
Jun 02, 2017 3:08:10 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 62 ms
Jun 02, 2017 3:08:10 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
Jun 02, 2017 3:08:10 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2017 3:08:10 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 101 place invariants in 54 ms
Jun 02, 2017 3:08:13 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 273 variables to be positive in 2702 ms
Jun 02, 2017 3:08:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 179 transitions.
Jun 02, 2017 3:08:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/179 took 17 ms. Total solver calls (SAT/UNSAT): 3(1/2)
Jun 02, 2017 3:08:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :75/179 took 1028 ms. Total solver calls (SAT/UNSAT): 184(82/102)
Jun 02, 2017 3:08:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :139/179 took 2037 ms. Total solver calls (SAT/UNSAT): 351(184/167)
Jun 02, 2017 3:08:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2469 ms. Total solver calls (SAT/UNSAT): 431(223/208)
Jun 02, 2017 3:08:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 179 transitions.
Jun 02, 2017 3:08:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :106/179 took 1007 ms. Total solver calls (SAT/UNSAT): 279(131/148)
Jun 02, 2017 3:08:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1587 ms. Total solver calls (SAT/UNSAT): 431(206/225)
Jun 02, 2017 3:08:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 179 transitions.
Jun 02, 2017 3:08:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(2/179) took 1692 ms. Total solver calls (SAT/UNSAT): 534(358/176)
Jun 02, 2017 3:08:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(4/179) took 3129 ms. Total solver calls (SAT/UNSAT): 885(709/176)
Jun 02, 2017 3:08:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(6/179) took 4768 ms. Total solver calls (SAT/UNSAT): 1232(1056/176)
Jun 02, 2017 3:08:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(8/179) took 6510 ms. Total solver calls (SAT/UNSAT): 1575(1399/176)
Jun 02, 2017 3:08:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(10/179) took 7860 ms. Total solver calls (SAT/UNSAT): 1914(1738/176)
Jun 02, 2017 3:08:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(12/179) took 9205 ms. Total solver calls (SAT/UNSAT): 2249(2073/176)
Jun 02, 2017 3:08:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(14/179) took 10798 ms. Total solver calls (SAT/UNSAT): 2580(2404/176)
Jun 02, 2017 3:08:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(16/179) took 12196 ms. Total solver calls (SAT/UNSAT): 2907(2731/176)
Jun 02, 2017 3:08:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(18/179) took 13653 ms. Total solver calls (SAT/UNSAT): 3230(3054/176)
Jun 02, 2017 3:08:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(20/179) took 15203 ms. Total solver calls (SAT/UNSAT): 3549(3373/176)
Jun 02, 2017 3:08:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(22/179) took 16637 ms. Total solver calls (SAT/UNSAT): 3864(3688/176)
Jun 02, 2017 3:08:35 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(24/179) took 17962 ms. Total solver calls (SAT/UNSAT): 4175(3999/176)
Jun 02, 2017 3:08:36 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(26/179) took 19197 ms. Total solver calls (SAT/UNSAT): 4482(4306/176)
Jun 02, 2017 3:08:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(28/179) took 20490 ms. Total solver calls (SAT/UNSAT): 4785(4609/176)
Jun 02, 2017 3:08:39 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(30/179) took 21691 ms. Total solver calls (SAT/UNSAT): 5084(4908/176)
Jun 02, 2017 3:08:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(32/179) took 22987 ms. Total solver calls (SAT/UNSAT): 5379(5203/176)
Jun 02, 2017 3:08:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(34/179) took 24206 ms. Total solver calls (SAT/UNSAT): 5670(5494/176)
Jun 02, 2017 3:08:42 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(36/179) took 25350 ms. Total solver calls (SAT/UNSAT): 5957(5781/176)
Jun 02, 2017 3:08:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(38/179) took 26491 ms. Total solver calls (SAT/UNSAT): 6240(6064/176)
Jun 02, 2017 3:08:45 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(40/179) took 27631 ms. Total solver calls (SAT/UNSAT): 6519(6343/176)
Jun 02, 2017 3:08:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(42/179) took 28965 ms. Total solver calls (SAT/UNSAT): 6794(6618/176)
Jun 02, 2017 3:08:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(44/179) took 30079 ms. Total solver calls (SAT/UNSAT): 7065(6889/176)
Jun 02, 2017 3:08:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(46/179) took 31148 ms. Total solver calls (SAT/UNSAT): 7332(7156/176)
Jun 02, 2017 3:08:49 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(48/179) took 32202 ms. Total solver calls (SAT/UNSAT): 7595(7419/176)
Jun 02, 2017 3:08:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(50/179) took 33227 ms. Total solver calls (SAT/UNSAT): 7854(7678/176)
Jun 02, 2017 3:08:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(52/179) took 34265 ms. Total solver calls (SAT/UNSAT): 8109(7933/176)
Jun 02, 2017 3:08:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(54/179) took 35317 ms. Total solver calls (SAT/UNSAT): 8360(8184/176)
Jun 02, 2017 3:08:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(57/179) took 36798 ms. Total solver calls (SAT/UNSAT): 8729(8553/176)
Jun 02, 2017 3:08:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(60/179) took 38256 ms. Total solver calls (SAT/UNSAT): 9089(8913/176)
Jun 02, 2017 3:08:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(63/179) took 39685 ms. Total solver calls (SAT/UNSAT): 9440(9264/176)
Jun 02, 2017 3:08:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(66/179) took 41062 ms. Total solver calls (SAT/UNSAT): 9782(9606/176)
Jun 02, 2017 3:08:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(69/179) took 42398 ms. Total solver calls (SAT/UNSAT): 10115(9939/176)
Jun 02, 2017 3:09:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(72/179) took 43719 ms. Total solver calls (SAT/UNSAT): 10439(10263/176)
Jun 02, 2017 3:09:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(75/179) took 44967 ms. Total solver calls (SAT/UNSAT): 10754(10578/176)
Jun 02, 2017 3:09:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(78/179) took 46135 ms. Total solver calls (SAT/UNSAT): 11060(10884/176)
Jun 02, 2017 3:09:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(81/179) took 47340 ms. Total solver calls (SAT/UNSAT): 11357(11181/176)
Jun 02, 2017 3:09:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(84/179) took 48478 ms. Total solver calls (SAT/UNSAT): 11645(11469/176)
Jun 02, 2017 3:09:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(87/179) took 49698 ms. Total solver calls (SAT/UNSAT): 11924(11748/176)
Jun 02, 2017 3:09:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(90/179) took 50777 ms. Total solver calls (SAT/UNSAT): 12194(12018/176)
Jun 02, 2017 3:09:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(93/179) took 51915 ms. Total solver calls (SAT/UNSAT): 12455(12279/176)
Jun 02, 2017 3:09:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(96/179) took 53037 ms. Total solver calls (SAT/UNSAT): 12707(12531/176)
Jun 02, 2017 3:09:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(99/179) took 54117 ms. Total solver calls (SAT/UNSAT): 12950(12774/176)
Jun 02, 2017 3:09:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(103/179) took 55487 ms. Total solver calls (SAT/UNSAT): 13260(13084/176)
Jun 02, 2017 3:09:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(106/179) took 56503 ms. Total solver calls (SAT/UNSAT): 13482(13306/176)
Jun 02, 2017 3:09:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(110/179) took 57826 ms. Total solver calls (SAT/UNSAT): 13764(13588/176)
Jun 02, 2017 3:09:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(114/179) took 59040 ms. Total solver calls (SAT/UNSAT): 14030(13854/176)
Jun 02, 2017 3:09:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(118/179) took 60296 ms. Total solver calls (SAT/UNSAT): 14280(14104/176)
Jun 02, 2017 3:09:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(123/179) took 61516 ms. Total solver calls (SAT/UNSAT): 14570(14394/176)
Jun 02, 2017 3:09:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(128/179) took 62596 ms. Total solver calls (SAT/UNSAT): 14835(14659/176)
Jun 02, 2017 3:09:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(134/179) took 63745 ms. Total solver calls (SAT/UNSAT): 15120(14944/176)
Jun 02, 2017 3:09:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(140/179) took 64745 ms. Total solver calls (SAT/UNSAT): 15369(15193/176)
Jun 02, 2017 3:09:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(148/179) took 65851 ms. Total solver calls (SAT/UNSAT): 15645(15469/176)
Jun 02, 2017 3:09:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(157/179) took 66853 ms. Total solver calls (SAT/UNSAT): 15879(15703/176)
Jun 02, 2017 3:09:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 67847 ms. Total solver calls (SAT/UNSAT): 16110(15934/176)
Jun 02, 2017 3:09:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 179 transitions.
Jun 02, 2017 3:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 51168 ms. Total solver calls (SAT/UNSAT): 239(0/239)
Jun 02, 2017 3:10:16 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 126139ms conformant to PINS in folder :/home/mcc/execution
Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, []((LTLAP0==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.003: completed loading model GAL
pins2lts-seq, 0.003: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.049: LTL layer: formula: []((LTLAP0==true))
pins2lts-seq, 0.049: Expression is: ([] (LTLAP0 == true ))
pins2lts-seq, 0.050: buchi has 2 states
pins2lts-seq, 0.050: state 0: non-accepting
pins2lts-seq, 0.050: -> 0, | true
pins2lts-seq, 0.050: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.050: state 1: accepting
pins2lts-seq, 0.050: -> 1, | true
pins2lts-seq, 0.051: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.052: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.052: State length is 274, there are 182 groups
pins2lts-seq, 0.052: Running scc search strategy
pins2lts-seq, 0.052: Using a tree for state storage
pins2lts-seq, 0.052: Visible groups: 0 / 182, labels: 1 / 202
pins2lts-seq, 0.052: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.059: accepting cycle found!
pins2lts-seq, 0.059: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, []((<>(<>((LTLAP1==true))))U(((LTLAP2==true))U((LTLAP3==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.054: LTL layer: formula: []((<>(<>((LTLAP1==true))))U(((LTLAP2==true))U((LTLAP3==true))))
pins2lts-seq, 0.054: Expression is: ([] ((<> (<> (LTLAP1 == true ))) U ((LTLAP2 == true ) U (LTLAP3 == true ))))
pins2lts-seq, 0.054: buchi has 4 states
pins2lts-seq, 0.054: state 0: non-accepting
pins2lts-seq, 0.054: -> 0, | true
pins2lts-seq, 0.054: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.054: -> 2, | !(LTLAP3 == true )
pins2lts-seq, 0.054: -> 3, | !(LTLAP3 == true ) && !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.054: state 1: accepting
pins2lts-seq, 0.054: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.054: -> 3, | !(LTLAP3 == true ) && !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.054: state 2: accepting
pins2lts-seq, 0.054: -> 3, | !(LTLAP3 == true ) && !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.054: -> 2, | !(LTLAP3 == true )
pins2lts-seq, 0.054: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.054: state 3: accepting
pins2lts-seq, 0.054: -> 3, | !(LTLAP1 == true )
pins2lts-seq, 0.055: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.056: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.056: State length is 274, there are 189 groups
pins2lts-seq, 0.056: Running scc search strategy
pins2lts-seq, 0.056: Using a tree for state storage
pins2lts-seq, 0.056: Visible groups: 0 / 189, labels: 3 / 202
pins2lts-seq, 0.056: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.108: accepting cycle found!
pins2lts-seq, 0.108: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP4==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.042: LTL layer: formula: (LTLAP4==true)
pins2lts-seq, 0.042: Expression is: (LTLAP4 == true )
pins2lts-seq, 0.042: buchi has 2 states
pins2lts-seq, 0.042: state 0: accepting
pins2lts-seq, 0.042: -> 1, | !(LTLAP4 == true )
pins2lts-seq, 0.042: state 1: accepting
pins2lts-seq, 0.042: -> 1, | true
pins2lts-seq, 0.043: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.044: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.044: State length is 274, there are 181 groups
pins2lts-seq, 0.044: Running scc search strategy
pins2lts-seq, 0.044: Using a tree for state storage
pins2lts-seq, 0.044: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.044: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.048: accepting cycle found!
pins2lts-seq, 0.048: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X([](X((LTLAP5==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: X([](X((LTLAP5==true))))
pins2lts-seq, 0.001: Expression is: (X ([] (X (LTLAP5 == true ))))
pins2lts-seq, 0.001: buchi has 4 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 2: non-accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: -> 3, | !(LTLAP5 == true )
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 184 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.011: accepting cycle found!
pins2lts-seq, 0.011: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>([](X([](X((LTLAP6==true))))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: <>([](X([](X((LTLAP6==true))))))
pins2lts-seq, 0.001: Expression is: (<> ([] (X ([] (X (LTLAP6 == true ))))))
pins2lts-seq, 0.001: buchi has 4 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.001: state 1: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 2, | !(LTLAP6 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP6 == true )
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 2, | !(LTLAP6 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP6 == true )
pins2lts-seq, 0.001: state 3: non-accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 189 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.016: accepting cycle found!
pins2lts-seq, 0.016: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X([](<>((LTLAP7==true)))))U(<>(<>(<>((LTLAP8==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: (X([](<>((LTLAP7==true)))))U(<>(<>(<>((LTLAP8==true)))))
pins2lts-seq, 0.001: Expression is: ((X ([] (<> (LTLAP7 == true )))) U (<> (<> (<> (LTLAP8 == true )))))
pins2lts-seq, 0.001: buchi has 1 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 0, | !(LTLAP8 == true )
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 180 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.011: accepting cycle found!
pins2lts-seq, 0.011: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP9==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.035: LTL layer: formula: (LTLAP9==true)
pins2lts-seq, 0.035: Expression is: (LTLAP9 == true )
pins2lts-seq, 0.035: buchi has 2 states
pins2lts-seq, 0.035: state 0: accepting
pins2lts-seq, 0.035: -> 1, | !(LTLAP9 == true )
pins2lts-seq, 0.035: state 1: accepting
pins2lts-seq, 0.035: -> 1, | true
pins2lts-seq, 0.036: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.036: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.036: State length is 274, there are 181 groups
pins2lts-seq, 0.036: Running scc search strategy
pins2lts-seq, 0.036: Using a tree for state storage
pins2lts-seq, 0.036: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.036: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.043: accepting cycle found!
pins2lts-seq, 0.043: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP10==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.034: LTL layer: formula: (LTLAP10==true)
pins2lts-seq, 0.034: Expression is: (LTLAP10 == true )
pins2lts-seq, 0.034: buchi has 2 states
pins2lts-seq, 0.034: state 0: accepting
pins2lts-seq, 0.035: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.035: state 1: accepting
pins2lts-seq, 0.035: -> 1, | true
pins2lts-seq, 0.035: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.036: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.036: State length is 274, there are 181 groups
pins2lts-seq, 0.036: Running scc search strategy
pins2lts-seq, 0.036: Using a tree for state storage
pins2lts-seq, 0.036: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.036: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.042: accepting cycle found!
pins2lts-seq, 0.042: exiting now

Jun 02, 2017 3:10:18 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X((LTLAP11==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: X((LTLAP11==true))
pins2lts-seq, 0.001: Expression is: (X (LTLAP11 == true ))
pins2lts-seq, 0.001: buchi has 3 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 182 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.011: accepting cycle found!
pins2lts-seq, 0.011: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP12==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.034: LTL layer: formula: (LTLAP12==true)
pins2lts-seq, 0.035: Expression is: (LTLAP12 == true )
pins2lts-seq, 0.035: buchi has 2 states
pins2lts-seq, 0.035: state 0: accepting
pins2lts-seq, 0.035: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.035: state 1: accepting
pins2lts-seq, 0.035: -> 1, | true
pins2lts-seq, 0.035: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.036: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.036: State length is 274, there are 181 groups
pins2lts-seq, 0.036: Running scc search strategy
pins2lts-seq, 0.036: Using a tree for state storage
pins2lts-seq, 0.036: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.036: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.043: accepting cycle found!
pins2lts-seq, 0.043: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (<>(((LTLAP13==true))U((LTLAP5==true))))U(X(<>((LTLAP14==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: (<>(((LTLAP13==true))U((LTLAP5==true))))U(X(<>((LTLAP14==true))))
pins2lts-seq, 0.001: Expression is: ((<> ((LTLAP13 == true ) U (LTLAP5 == true ))) U (X (<> (LTLAP14 == true ))))
pins2lts-seq, 0.001: buchi has 3 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 2, | !(LTLAP5 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP14 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP14 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 2, | !(LTLAP14 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 184 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.011: accepting cycle found!
pins2lts-seq, 0.011: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>(<>([]([]([]((LTLAP15==true))))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.034: LTL layer: formula: <>(<>([]([]([]((LTLAP15==true))))))
pins2lts-seq, 0.034: Expression is: (<> (<> ([] ([] ([] (LTLAP15 == true ))))))
pins2lts-seq, 0.034: buchi has 2 states
pins2lts-seq, 0.034: state 0: non-accepting
pins2lts-seq, 0.035: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.035: -> 0, | true
pins2lts-seq, 0.035: state 1: accepting
pins2lts-seq, 0.035: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.035: -> 0, | true
pins2lts-seq, 0.035: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.036: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.036: State length is 274, there are 183 groups
pins2lts-seq, 0.036: Running scc search strategy
pins2lts-seq, 0.036: Using a tree for state storage
pins2lts-seq, 0.036: Visible groups: 0 / 183, labels: 1 / 202
pins2lts-seq, 0.036: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.044: accepting cycle found!
pins2lts-seq, 0.044: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X(<>(X(<>(X((LTLAP16==true))))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: X(<>(X(<>(X((LTLAP16==true))))))
pins2lts-seq, 0.001: Expression is: (X (<> (X (<> (X (LTLAP16 == true ))))))
pins2lts-seq, 0.001: buchi has 4 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP16 == true )
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 183 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.012: accepting cycle found!
pins2lts-seq, 0.012: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, [](((LTLAP17==true))U(<>(X((LTLAP18==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: [](((LTLAP17==true))U(<>(X((LTLAP18==true)))))
pins2lts-seq, 0.001: Expression is: ([] ((LTLAP17 == true ) U (<> (X (LTLAP18 == true )))))
pins2lts-seq, 0.001: buchi has 3 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 0, | true
pins2lts-seq, 0.001: -> 1, | !(LTLAP17 == true )
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 2, | !(LTLAP18 == true )
pins2lts-seq, 0.001: -> 1, | !(LTLAP18 == true ) && !(LTLAP17 == true )
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 185 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.011: accepting cycle found!
pins2lts-seq, 0.011: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X((<>([]((LTLAP19==true))))U((LTLAP20==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: X((<>([]((LTLAP19==true))))U((LTLAP20==true)))
pins2lts-seq, 0.001: Expression is: (X ((<> ([] (LTLAP19 == true ))) U (LTLAP20 == true )))
pins2lts-seq, 0.001: buchi has 4 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP20 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.001: state 2: non-accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.003: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 274, there are 186 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.016: accepting cycle found!
pins2lts-seq, 0.016: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP21==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.034: LTL layer: formula: (LTLAP21==true)
pins2lts-seq, 0.034: Expression is: (LTLAP21 == true )
pins2lts-seq, 0.034: buchi has 2 states
pins2lts-seq, 0.034: state 0: accepting
pins2lts-seq, 0.035: -> 1, | !(LTLAP21 == true )
pins2lts-seq, 0.035: state 1: accepting
pins2lts-seq, 0.035: -> 1, | true
pins2lts-seq, 0.035: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.036: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.036: State length is 274, there are 181 groups
pins2lts-seq, 0.036: Running scc search strategy
pins2lts-seq, 0.036: Using a tree for state storage
pins2lts-seq, 0.036: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.036: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.040: accepting cycle found!
pins2lts-seq, 0.040: exiting now

Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 3:10:19 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

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="S_IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/S_IBMB2S565S3960-PT-none.tgz
mv S_IBMB2S565S3960-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_IBMB2S565S3960-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r120-blw7-149441651800096"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;