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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3136.310 134463.00 271474.00 126.80 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 IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-blw7-149440486300096
=====================================================================


--------------------
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 1496261942421


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 1496262076884

--------------------
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
May 31, 2017 8:19:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 8:19:03 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 65 ms
May 31, 2017 8:19:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 273 places.
May 31, 2017 8:19:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 179 transitions.
May 31, 2017 8:19:04 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 58 ms
May 31, 2017 8:19:04 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 16 ms
May 31, 2017 8:19:04 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 31, 2017 8:19:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 101 place invariants in 73 ms
May 31, 2017 8:19:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 273 variables to be positive in 2408 ms
May 31, 2017 8:19:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 179 transitions.
May 31, 2017 8:19:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/179 took 39 ms. Total solver calls (SAT/UNSAT): 3(1/2)
May 31, 2017 8:19:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :71/179 took 1057 ms. Total solver calls (SAT/UNSAT): 174(76/98)
May 31, 2017 8:19:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :138/179 took 2058 ms. Total solver calls (SAT/UNSAT): 349(183/166)
May 31, 2017 8:19:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2496 ms. Total solver calls (SAT/UNSAT): 431(223/208)
May 31, 2017 8:19:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 179 transitions.
May 31, 2017 8:19:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :115/179 took 1002 ms. Total solver calls (SAT/UNSAT): 302(140/162)
May 31, 2017 8:19:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1504 ms. Total solver calls (SAT/UNSAT): 431(206/225)
May 31, 2017 8:19:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 179 transitions.
May 31, 2017 8:19:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(2/179) took 1464 ms. Total solver calls (SAT/UNSAT): 534(358/176)
May 31, 2017 8:19:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(4/179) took 2907 ms. Total solver calls (SAT/UNSAT): 885(709/176)
May 31, 2017 8:19:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(6/179) took 4305 ms. Total solver calls (SAT/UNSAT): 1232(1056/176)
May 31, 2017 8:19:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(8/179) took 5677 ms. Total solver calls (SAT/UNSAT): 1575(1399/176)
May 31, 2017 8:19:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(10/179) took 7012 ms. Total solver calls (SAT/UNSAT): 1914(1738/176)
May 31, 2017 8:19:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(12/179) took 8353 ms. Total solver calls (SAT/UNSAT): 2249(2073/176)
May 31, 2017 8:19:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(14/179) took 9674 ms. Total solver calls (SAT/UNSAT): 2580(2404/176)
May 31, 2017 8:19:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(16/179) took 11033 ms. Total solver calls (SAT/UNSAT): 2907(2731/176)
May 31, 2017 8:19:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(18/179) took 12311 ms. Total solver calls (SAT/UNSAT): 3230(3054/176)
May 31, 2017 8:19:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(20/179) took 13576 ms. Total solver calls (SAT/UNSAT): 3549(3373/176)
May 31, 2017 8:19:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(22/179) took 14827 ms. Total solver calls (SAT/UNSAT): 3864(3688/176)
May 31, 2017 8:19:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(24/179) took 16108 ms. Total solver calls (SAT/UNSAT): 4175(3999/176)
May 31, 2017 8:19:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(26/179) took 17365 ms. Total solver calls (SAT/UNSAT): 4482(4306/176)
May 31, 2017 8:19:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(28/179) took 18605 ms. Total solver calls (SAT/UNSAT): 4785(4609/176)
May 31, 2017 8:19:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(30/179) took 19828 ms. Total solver calls (SAT/UNSAT): 5084(4908/176)
May 31, 2017 8:19:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(32/179) took 21033 ms. Total solver calls (SAT/UNSAT): 5379(5203/176)
May 31, 2017 8:19:33 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(34/179) took 22201 ms. Total solver calls (SAT/UNSAT): 5670(5494/176)
May 31, 2017 8:19:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(36/179) took 23524 ms. Total solver calls (SAT/UNSAT): 5957(5781/176)
May 31, 2017 8:19:35 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(38/179) took 24666 ms. Total solver calls (SAT/UNSAT): 6240(6064/176)
May 31, 2017 8:19:36 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(40/179) took 25807 ms. Total solver calls (SAT/UNSAT): 6519(6343/176)
May 31, 2017 8:19:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(42/179) took 26944 ms. Total solver calls (SAT/UNSAT): 6794(6618/176)
May 31, 2017 8:19:39 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(44/179) took 28039 ms. Total solver calls (SAT/UNSAT): 7065(6889/176)
May 31, 2017 8:19:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(46/179) took 29140 ms. Total solver calls (SAT/UNSAT): 7332(7156/176)
May 31, 2017 8:19:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(48/179) took 30246 ms. Total solver calls (SAT/UNSAT): 7595(7419/176)
May 31, 2017 8:19:42 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(50/179) took 31369 ms. Total solver calls (SAT/UNSAT): 7854(7678/176)
May 31, 2017 8:19:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(52/179) took 32495 ms. Total solver calls (SAT/UNSAT): 8109(7933/176)
May 31, 2017 8:19:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(54/179) took 33536 ms. Total solver calls (SAT/UNSAT): 8360(8184/176)
May 31, 2017 8:19:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(57/179) took 35024 ms. Total solver calls (SAT/UNSAT): 8729(8553/176)
May 31, 2017 8:19:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(60/179) took 36484 ms. Total solver calls (SAT/UNSAT): 9089(8913/176)
May 31, 2017 8:19:49 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(63/179) took 37906 ms. Total solver calls (SAT/UNSAT): 9440(9264/176)
May 31, 2017 8:19:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(65/179) took 38966 ms. Total solver calls (SAT/UNSAT): 9669(9493/176)
May 31, 2017 8:19:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(68/179) took 40306 ms. Total solver calls (SAT/UNSAT): 10005(9829/176)
May 31, 2017 8:19:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(70/179) took 41320 ms. Total solver calls (SAT/UNSAT): 10224(10048/176)
May 31, 2017 8:19:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(73/179) took 42624 ms. Total solver calls (SAT/UNSAT): 10545(10369/176)
May 31, 2017 8:19:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(76/179) took 43858 ms. Total solver calls (SAT/UNSAT): 10857(10681/176)
May 31, 2017 8:19:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(79/179) took 45342 ms. Total solver calls (SAT/UNSAT): 11160(10984/176)
May 31, 2017 8:19:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(82/179) took 46662 ms. Total solver calls (SAT/UNSAT): 11454(11278/176)
May 31, 2017 8:19:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(85/179) took 47952 ms. Total solver calls (SAT/UNSAT): 11739(11563/176)
May 31, 2017 8:20:00 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(88/179) took 49055 ms. Total solver calls (SAT/UNSAT): 12015(11839/176)
May 31, 2017 8:20:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(91/179) took 50236 ms. Total solver calls (SAT/UNSAT): 12282(12106/176)
May 31, 2017 8:20:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(94/179) took 51285 ms. Total solver calls (SAT/UNSAT): 12540(12364/176)
May 31, 2017 8:20:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(97/179) took 52419 ms. Total solver calls (SAT/UNSAT): 12789(12613/176)
May 31, 2017 8:20:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(100/179) took 53454 ms. Total solver calls (SAT/UNSAT): 13029(12853/176)
May 31, 2017 8:20:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(103/179) took 54667 ms. Total solver calls (SAT/UNSAT): 13260(13084/176)
May 31, 2017 8:20:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(106/179) took 55711 ms. Total solver calls (SAT/UNSAT): 13482(13306/176)
May 31, 2017 8:20:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(109/179) took 56780 ms. Total solver calls (SAT/UNSAT): 13695(13519/176)
May 31, 2017 8:20:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(113/179) took 58091 ms. Total solver calls (SAT/UNSAT): 13965(13789/176)
May 31, 2017 8:20:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(117/179) took 59342 ms. Total solver calls (SAT/UNSAT): 14219(14043/176)
May 31, 2017 8:20:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(121/179) took 60387 ms. Total solver calls (SAT/UNSAT): 14457(14281/176)
May 31, 2017 8:20:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(125/179) took 61390 ms. Total solver calls (SAT/UNSAT): 14679(14503/176)
May 31, 2017 8:20:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(130/179) took 62475 ms. Total solver calls (SAT/UNSAT): 14934(14758/176)
May 31, 2017 8:20:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(136/179) took 63572 ms. Total solver calls (SAT/UNSAT): 15207(15031/176)
May 31, 2017 8:20:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(143/179) took 64671 ms. Total solver calls (SAT/UNSAT): 15480(15304/176)
May 31, 2017 8:20:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(151/179) took 65695 ms. Total solver calls (SAT/UNSAT): 15732(15556/176)
May 31, 2017 8:20:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(160/179) took 66701 ms. Total solver calls (SAT/UNSAT): 15939(15763/176)
May 31, 2017 8:20:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 67573 ms. Total solver calls (SAT/UNSAT): 16110(15934/176)
May 31, 2017 8:20:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 179 transitions.
May 31, 2017 8:21:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 54108 ms. Total solver calls (SAT/UNSAT): 239(0/239)
May 31, 2017 8:21:12 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 128513ms conformant to PINS in folder :/home/mcc/execution
May 31, 2017 8:21:15 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.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.040: LTL layer: formula: []((LTLAP0==true))
pins2lts-seq, 0.040: Expression is: ([] (LTLAP0 == true ))
pins2lts-seq, 0.040: buchi has 2 states
pins2lts-seq, 0.040: state 0: non-accepting
pins2lts-seq, 0.040: -> 0, | true
pins2lts-seq, 0.040: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.040: state 1: accepting
pins2lts-seq, 0.040: -> 1, | true
pins2lts-seq, 0.041: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.042: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.042: State length is 274, there are 182 groups
pins2lts-seq, 0.042: Running scc search strategy
pins2lts-seq, 0.042: Using a tree for state storage
pins2lts-seq, 0.042: Visible groups: 0 / 182, labels: 1 / 202
pins2lts-seq, 0.042: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.049: accepting cycle found!
pins2lts-seq, 0.049: exiting now

May 31, 2017 8:21:15 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.003: completed loading model GAL
pins2lts-seq, 0.003: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.080: LTL layer: formula: []((<>(<>((LTLAP1==true))))U(((LTLAP2==true))U((LTLAP3==true))))
pins2lts-seq, 0.080: Expression is: ([] ((<> (<> (LTLAP1 == true ))) U ((LTLAP2 == true ) U (LTLAP3 == true ))))
pins2lts-seq, 0.081: buchi has 4 states
pins2lts-seq, 0.081: state 0: non-accepting
pins2lts-seq, 0.081: -> 0, | true
pins2lts-seq, 0.081: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.081: -> 2, | !(LTLAP3 == true )
pins2lts-seq, 0.081: -> 3, | !(LTLAP3 == true ) && !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.081: state 1: accepting
pins2lts-seq, 0.081: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.081: -> 3, | !(LTLAP3 == true ) && !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.081: state 2: accepting
pins2lts-seq, 0.081: -> 3, | !(LTLAP3 == true ) && !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.081: -> 2, | !(LTLAP3 == true )
pins2lts-seq, 0.081: -> 1, | !(LTLAP3 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.081: state 3: accepting
pins2lts-seq, 0.081: -> 3, | !(LTLAP1 == true )
pins2lts-seq, 0.082: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.083: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.083: State length is 274, there are 189 groups
pins2lts-seq, 0.083: Running scc search strategy
pins2lts-seq, 0.083: Using a tree for state storage
pins2lts-seq, 0.083: Visible groups: 0 / 189, labels: 3 / 202
pins2lts-seq, 0.083: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.150: accepting cycle found!
pins2lts-seq, 0.150: exiting now

May 31, 2017 8:21:15 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.003: completed loading model GAL
pins2lts-seq, 0.003: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.096: LTL layer: formula: (LTLAP4==true)
pins2lts-seq, 0.096: Expression is: (LTLAP4 == true )
pins2lts-seq, 0.096: buchi has 2 states
pins2lts-seq, 0.096: state 0: accepting
pins2lts-seq, 0.096: -> 1, | !(LTLAP4 == true )
pins2lts-seq, 0.096: state 1: accepting
pins2lts-seq, 0.096: -> 1, | true
pins2lts-seq, 0.098: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.099: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.099: State length is 274, there are 181 groups
pins2lts-seq, 0.099: Running scc search strategy
pins2lts-seq, 0.099: Using a tree for state storage
pins2lts-seq, 0.099: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.099: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.107: accepting cycle found!
pins2lts-seq, 0.107: exiting now

May 31, 2017 8:21:15 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.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: X([](X((LTLAP5==true))))
pins2lts-seq, 0.003: Expression is: (X ([] (X (LTLAP5 == true ))))
pins2lts-seq, 0.003: buchi has 4 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 2: non-accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: -> 3, | !(LTLAP5 == true )
pins2lts-seq, 0.003: state 3: accepting
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.008: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.008: State length is 274, there are 184 groups
pins2lts-seq, 0.008: Running scc search strategy
pins2lts-seq, 0.008: Using a tree for state storage
pins2lts-seq, 0.027: accepting cycle found!
pins2lts-seq, 0.027: exiting now

May 31, 2017 8:21:15 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.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: <>([](X([](X((LTLAP6==true))))))
pins2lts-seq, 0.003: Expression is: (<> ([] (X ([] (X (LTLAP6 == true ))))))
pins2lts-seq, 0.003: buchi has 4 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.003: state 1: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 2, | !(LTLAP6 == true )
pins2lts-seq, 0.003: -> 3, | !(LTLAP6 == true )
pins2lts-seq, 0.003: state 2: accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 2, | !(LTLAP6 == true )
pins2lts-seq, 0.003: -> 3, | !(LTLAP6 == true )
pins2lts-seq, 0.003: state 3: non-accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.008: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.008: State length is 274, there are 189 groups
pins2lts-seq, 0.008: Running scc search strategy
pins2lts-seq, 0.008: Using a tree for state storage
pins2lts-seq, 0.035: accepting cycle found!
pins2lts-seq, 0.035: exiting now

May 31, 2017 8:21:15 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.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: (X([](<>((LTLAP7==true)))))U(<>(<>(<>((LTLAP8==true)))))
pins2lts-seq, 0.002: Expression is: ((X ([] (<> (LTLAP7 == true )))) U (<> (<> (<> (LTLAP8 == true )))))
pins2lts-seq, 0.002: buchi has 1 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.003: -> 0, | !(LTLAP8 == true )
pins2lts-seq, 0.006: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.006: State length is 274, there are 180 groups
pins2lts-seq, 0.006: Running scc search strategy
pins2lts-seq, 0.006: Using a tree for state storage
pins2lts-seq, 0.018: accepting cycle found!
pins2lts-seq, 0.018: exiting now

May 31, 2017 8:21:16 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.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.081: LTL layer: formula: (LTLAP9==true)
pins2lts-seq, 0.081: Expression is: (LTLAP9 == true )
pins2lts-seq, 0.081: buchi has 2 states
pins2lts-seq, 0.082: state 0: accepting
pins2lts-seq, 0.082: -> 1, | !(LTLAP9 == true )
pins2lts-seq, 0.082: state 1: accepting
pins2lts-seq, 0.082: -> 1, | true
pins2lts-seq, 0.083: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.084: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.084: State length is 274, there are 181 groups
pins2lts-seq, 0.084: Running scc search strategy
pins2lts-seq, 0.084: Using a tree for state storage
pins2lts-seq, 0.084: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.084: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.096: accepting cycle found!
pins2lts-seq, 0.096: exiting now

May 31, 2017 8:21:16 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.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.052: LTL layer: formula: (LTLAP10==true)
pins2lts-seq, 0.053: Expression is: (LTLAP10 == true )
pins2lts-seq, 0.053: buchi has 2 states
pins2lts-seq, 0.053: state 0: accepting
pins2lts-seq, 0.053: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.053: state 1: accepting
pins2lts-seq, 0.053: -> 1, | true
pins2lts-seq, 0.054: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.055: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.055: State length is 274, there are 181 groups
pins2lts-seq, 0.055: Running scc search strategy
pins2lts-seq, 0.055: Using a tree for state storage
pins2lts-seq, 0.055: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.055: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.062: accepting cycle found!
pins2lts-seq, 0.062: exiting now

May 31, 2017 8:21:16 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.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: X((LTLAP11==true))
pins2lts-seq, 0.004: Expression is: (X (LTLAP11 == true ))
pins2lts-seq, 0.004: buchi has 3 states
pins2lts-seq, 0.004: state 0: accepting
pins2lts-seq, 0.004: -> 1, | true
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.004: state 2: accepting
pins2lts-seq, 0.004: -> 2, | true
pins2lts-seq, 0.009: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.009: State length is 274, there are 182 groups
pins2lts-seq, 0.009: Running scc search strategy
pins2lts-seq, 0.009: Using a tree for state storage
pins2lts-seq, 0.027: accepting cycle found!
pins2lts-seq, 0.027: exiting now

May 31, 2017 8:21:16 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.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.076: LTL layer: formula: (LTLAP12==true)
pins2lts-seq, 0.076: Expression is: (LTLAP12 == true )
pins2lts-seq, 0.076: buchi has 2 states
pins2lts-seq, 0.076: state 0: accepting
pins2lts-seq, 0.076: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.076: state 1: accepting
pins2lts-seq, 0.076: -> 1, | true
pins2lts-seq, 0.078: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.079: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.079: State length is 274, there are 181 groups
pins2lts-seq, 0.079: Running scc search strategy
pins2lts-seq, 0.079: Using a tree for state storage
pins2lts-seq, 0.079: Visible groups: 0 / 181, labels: 1 / 202
pins2lts-seq, 0.079: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.090: accepting cycle found!
pins2lts-seq, 0.090: exiting now

May 31, 2017 8:21:16 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.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: (<>(((LTLAP13==true))U((LTLAP5==true))))U(X(<>((LTLAP14==true))))
pins2lts-seq, 0.002: Expression is: ((<> ((LTLAP13 == true ) U (LTLAP5 == true ))) U (X (<> (LTLAP14 == true ))))
pins2lts-seq, 0.002: buchi has 3 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 2, | !(LTLAP5 == true )
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP14 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP14 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 2, | !(LTLAP14 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.006: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.006: State length is 274, there are 184 groups
pins2lts-seq, 0.006: Running scc search strategy
pins2lts-seq, 0.006: Using a tree for state storage
pins2lts-seq, 0.018: accepting cycle found!
pins2lts-seq, 0.018: exiting now

May 31, 2017 8:21:16 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.005: completed loading model GAL
pins2lts-seq, 0.005: Initializing POR dependencies: labels 201, guards 179
pins2lts-seq, 0.121: LTL layer: formula: <>(<>([]([]([]((LTLAP15==true))))))
pins2lts-seq, 0.121: Expression is: (<> (<> ([] ([] ([] (LTLAP15 == true ))))))
pins2lts-seq, 0.121: buchi has 2 states
pins2lts-seq, 0.121: state 0: non-accepting
pins2lts-seq, 0.121: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.121: -> 0, | true
pins2lts-seq, 0.121: state 1: accepting
pins2lts-seq, 0.121: -> 1, | !(LTLAP15 == true )
pins2lts-seq, 0.121: -> 0, | true
pins2lts-seq, 0.123: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.124: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.124: State length is 274, there are 183 groups
pins2lts-seq, 0.124: Running scc search strategy
pins2lts-seq, 0.124: Using a tree for state storage
pins2lts-seq, 0.124: Visible groups: 0 / 183, labels: 1 / 202
pins2lts-seq, 0.124: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.136: accepting cycle found!
pins2lts-seq, 0.136: exiting now

May 31, 2017 8:21:16 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.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: X(<>(X(<>(X((LTLAP16==true))))))
pins2lts-seq, 0.004: Expression is: (X (<> (X (<> (X (LTLAP16 == true ))))))
pins2lts-seq, 0.004: buchi has 4 states
pins2lts-seq, 0.004: state 0: accepting
pins2lts-seq, 0.004: -> 1, | true
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 2, | true
pins2lts-seq, 0.004: state 2: accepting
pins2lts-seq, 0.004: -> 3, | true
pins2lts-seq, 0.004: state 3: accepting
pins2lts-seq, 0.004: -> 3, | !(LTLAP16 == true )
pins2lts-seq, 0.009: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.009: State length is 274, there are 183 groups
pins2lts-seq, 0.009: Running scc search strategy
pins2lts-seq, 0.009: Using a tree for state storage
pins2lts-seq, 0.031: accepting cycle found!
pins2lts-seq, 0.031: exiting now

May 31, 2017 8:21:16 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.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: [](((LTLAP17==true))U(<>(X((LTLAP18==true)))))
pins2lts-seq, 0.002: Expression is: ([] ((LTLAP17 == true ) U (<> (X (LTLAP18 == true )))))
pins2lts-seq, 0.002: buchi has 3 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: -> 1, | !(LTLAP17 == true )
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 2, | !(LTLAP18 == true )
pins2lts-seq, 0.002: -> 1, | !(LTLAP18 == true ) && !(LTLAP17 == true )
pins2lts-seq, 0.006: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.006: State length is 274, there are 185 groups
pins2lts-seq, 0.006: Running scc search strategy
pins2lts-seq, 0.006: Using a tree for state storage
pins2lts-seq, 0.017: accepting cycle found!
pins2lts-seq, 0.017: exiting now

May 31, 2017 8:21:16 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.002: buchi has 4 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP20 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.002: state 2: non-accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.002: state 3: accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.004: There are 202 state labels and 1 edge labels
pins2lts-seq, 0.004: State length is 274, there are 186 groups
pins2lts-seq, 0.004: Running scc search strategy
pins2lts-seq, 0.004: Using a tree for state storage
pins2lts-seq, 0.019: accepting cycle found!
pins2lts-seq, 0.019: exiting now

May 31, 2017 8:21:16 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.034: -> 1, | !(LTLAP21 == true )
pins2lts-seq, 0.034: state 1: accepting
pins2lts-seq, 0.034: -> 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

May 31, 2017 8:21:16 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 8:21:16 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 8:21:16 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="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/IBMB2S565S3960-PT-none.tgz
mv 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 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 r040-blw7-149440486300096"
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 ;