Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940144900346.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940144900346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 5.6K Apr 14 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 14 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 14 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 14 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 8 15:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 8 15:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 14 12:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 14 12:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 14 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 14 12:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 127K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589572610323

[2020-05-15 19:56:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 19:56:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 19:56:52] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-05-15 19:56:52] [INFO ] Transformed 273 places.
[2020-05-15 19:56:52] [INFO ] Transformed 179 transitions.
[2020-05-15 19:56:52] [INFO ] Parsed PT model containing 273 places and 179 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 407 resets, run finished after 152 ms. (steps per millisecond=657 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 179 rows 273 cols
[2020-05-15 19:56:53] [INFO ] Computed 101 place invariants in 28 ms
[2020-05-15 19:56:53] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-15 19:56:53] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 76 ms returned sat
[2020-05-15 19:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 19:56:53] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2020-05-15 19:56:54] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 25 ms.
[2020-05-15 19:56:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 19:56:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-05-15 19:56:54] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 43 ms returned sat
[2020-05-15 19:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 19:56:55] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2020-05-15 19:56:55] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 17 ms.
[2020-05-15 19:56:56] [INFO ] Added : 146 causal constraints over 30 iterations in 810 ms. Result :sat
[2020-05-15 19:56:56] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-05-15 19:56:56] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 142 ms returned sat
[2020-05-15 19:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 19:56:57] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2020-05-15 19:56:57] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 19 ms.
[2020-05-15 19:56:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 19:56:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 30 ms returned sat
[2020-05-15 19:56:57] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 43 ms returned sat
[2020-05-15 19:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 19:56:57] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-05-15 19:56:57] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 9 ms.
[2020-05-15 19:56:58] [INFO ] Added : 147 causal constraints over 30 iterations in 584 ms. Result :sat
[2020-05-15 19:56:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-15 19:56:58] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 67 ms returned sat
[2020-05-15 19:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 19:56:58] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-05-15 19:56:58] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 8 ms.
[2020-05-15 19:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 19:56:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-15 19:56:59] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2020-05-15 19:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 19:56:59] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-05-15 19:56:59] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 33 ms.
[2020-05-15 19:56:59] [INFO ] Added : 147 causal constraints over 30 iterations in 493 ms. Result :sat
[2020-05-15 19:56:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-15 19:56:59] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 24 ms returned sat
[2020-05-15 19:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 19:57:00] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-05-15 19:57:00] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 11 ms.
[2020-05-15 19:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 19:57:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-15 19:57:00] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 23 ms returned sat
[2020-05-15 19:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 19:57:00] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-05-15 19:57:00] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 16 ms.
[2020-05-15 19:57:01] [INFO ] Added : 153 causal constraints over 31 iterations in 392 ms. Result :sat
[2020-05-15 19:57:01] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-15 19:57:01] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 26 ms returned sat
[2020-05-15 19:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 19:57:01] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-05-15 19:57:01] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 40 ms.
[2020-05-15 19:57:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 19:57:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-15 19:57:02] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 177 ms returned sat
[2020-05-15 19:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 19:57:02] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-05-15 19:57:02] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 12 ms.
[2020-05-15 19:57:02] [INFO ] Added : 155 causal constraints over 31 iterations in 471 ms. Result :sat
[2020-05-15 19:57:02] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-15 19:57:02] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 50 ms returned sat
[2020-05-15 19:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 19:57:03] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2020-05-15 19:57:03] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 23 ms.
[2020-05-15 19:57:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 19:57:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-05-15 19:57:04] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 201 ms returned sat
[2020-05-15 19:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 19:57:04] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-05-15 19:57:04] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints in 13 ms.
[2020-05-15 19:57:05] [INFO ] Added : 153 causal constraints over 31 iterations in 535 ms. Result :sat
[2020-05-15 19:57:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 19:57:05] [INFO ] Flatten gal took : 41 ms
FORMULA IBMB2S565S3960-PT-none-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 19:57:05] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 19:57:05] [INFO ] Applying decomposition
[2020-05-15 19:57:05] [INFO ] Flatten gal took : 13 ms
[2020-05-15 19:57:05] [INFO ] Input system was already deterministic with 179 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 179 rows 273 cols
[2020-05-15 19:57:05] [INFO ] Computed 101 place invariants in 5 ms
inv : 2*alpha + 2*callToProcess.s00001108.input.s00001066 + 2*callToProcess.s00001108.inputCriterion.s00001053.used + 2*callToProcess.s00001108.output.s00001077 + callToProcess.s00003872.input.s00001066 + callToProcess.s00003872.inputCriterion.s00001053.used + callToProcess.s00003872.output.s00001077 + callToProcess.s00003876.input.s00001068 + callToProcess.s00003876.inputCriterion.s00001053.used + callToProcess.s00003876.output.s00001077 + callToProcess.s00003880.input.s00001066 + callToProcess.s00003880.inputCriterion.s00001053.used + callToProcess.s00003880.output.s00001077 + callToProcess.s00003884.input.s00001127 + callToProcess.s00003884.inputCriterion.s00001053.used + callToProcess.s00003884.output.s00001083 + callToProcess.s00003957.input.s00001066 + callToProcess.s00003957.input.s00001068 + 2*callToProcess.s00003957.inputCriterion.s00001053.used + 2*callToProcess.s00003957.output.s00001080 + callToTask.s00003908.input.s00001066 + callToTask.s00003908.inputCriterion.s00001053.used + callToTask.s00003908.output.s00001083 + callToTask.s00003913.input.s00001066 + callToTask.s00003913.inputCriterion.s00001053.used + callToTask.s00003913.output.s00001077 + 2*callToTask.s00003961.inputCriterion.s00001053.used + 2*callToTask.s00003961.output.s00001080 + callToTask.s00003962.input.s00001066 + callToTask.s00003962.inputCriterion.s00001053.used + callToTask.s00003962.output.s00001080 - callToTask.s00003963.input.s00001066 - callToTask.s00003963.inputCriterion.s00001053.used - callToTask.s00003963.output.s00001054 + 2*callToTask.s00003965.input.s00001066 + 2*callToTask.s00003965.inputCriterion.s00001053.used + 2*callToTask.s00003965.output.s00001077 + callToTask.s00003966.input.s00001068 + callToTask.s00003966.inputCriterion.s00001053.used + callToTask.s00003966.output.s00001054 + callToTask.s00003968.inputCriterion.s00001053.used + callToTask.s00003968.output.s00001080 + callToTask.s00003969.input.s00001066 + callToTask.s00003969.inputCriterion.s00001053.used + callToTask.s00003969.output.s00001080 + callToTask.s00003970.input.s00001068 + callToTask.s00003970.inputCriterion.s00001053.used + callToTask.s00003970.output.s00001077 + callToTask.s00003971.input.s00001066 + callToTask.s00003971.inputCriterion.s00001053.used + callToTask.s00003971.output.s00001077 + callToTask.s00003972.input.s00001066 + callToTask.s00003972.inputCriterion.s00001053.used + callToTask.s00003972.output.s00001077 + callToTask.s00003973.input.s00001068 + callToTask.s00003973.inputCriterion.s00001053.used + callToTask.s00003973.output.s00001077 + callToTask.s00003974.inputCriterion.s00001053.used + callToTask.s00003974.output.s00001077 - callToTask.s00003975.input.s00001127 - callToTask.s00003975.inputCriterion.s00001053.used - callToTask.s00003975.output.s00001080 + callToTask.s00003976.input.s00001066 + callToTask.s00003976.inputCriterion.s00001053.used + callToTask.s00003976.output.s00001077 + callToTask.s00003978.inputCriterion.s00001053.used + callToTask.s00003978.output.s00001080 - callToTask.s00003980.output.s00001054 + callToTask.s00003980.output.s00001083 + decision.s00001123.activated + decision.s00001126.activated + decision.s00001157.activated + decision.s00001158.activated + decision.s00001159.activated + decision.s00001840.activated + decision.s00001841.activated + decision.s00002055.activated + decision.s00002056.activated - decision.s00002761.activated + 2*decision.s00002762.activated + decision.s00002948.activated + decision.s00003020.activated + decision.s00003021.activated + endNode.s00002053.input.default - fork.s00001071.activated.s00001073 + fork.s00001071.activated.s00001075 + fork.s00001298.activated.s00001073 + fork.s00001298.input.s00001068 + fork.s00001403.activated.s00001075 + fork.s00001403.input.s00001066 + fork.s00002500.activated.s00001073 + fork.s00002500.input.s00001066 + join.s00001163.activated.s00001064 + join.s00001163.input.s00001128 + join.s00002243.activated.s00001062 - join.s00002243.activated.s00001065 + join.s00002243.input.s00001127 - join.s00002243.input.s00001263 + merge.s00001061.activated + merge.s00001061.input.s00001052 + merge.s00001061.input.s00001066 + merge.s00001061.input.s00001165 + merge.s00001061.input.s00001166 + merge.s00001160.activated + merge.s00001160.input.s00001052 + merge.s00001160.input.s00001066 + merge.s00001160.input.s00001165 + merge.s00001160.input.s00001166 + merge.s00001161.activated + merge.s00001161.input.s00001128 + merge.s00001161.input.s00001129 + merge.s00002238.activated + merge.s00002238.input.s00001052 + merge.s00002238.input.s00001066 + merge.s00002240.activated + merge.s00002240.input.s00001066 + merge.s00002240.input.s00001127 + merge.s00002240.input.s00001129 - merge.s00002241.activated - process.s00000565__s00003960.output.s00001249 - process.s00000565__s00003960.outputCriterion.s00001055_omega = 2
inv : callToTask.s00003978.output.s00001077 - callToTask.s00003978.output.s00001080 = 0
inv : callToTask.s00003972.output.s00001054 - callToTask.s00003972.output.s00001077 = 0
inv : callToTask.s00003970.output.s00001054 - callToTask.s00003970.output.s00001077 = 0
inv : callToProcess.s00003884.input.s00001052 - callToProcess.s00003884.input.s00001127 = 0
inv : callToTask.s00003966.input.s00001052 - callToTask.s00003966.input.s00001068 = 0
inv : callToProcess.s00003884.output.s00001054 - callToProcess.s00003884.output.s00001083 = 0
inv : callToTask.s00003908.input.s00001052 - callToTask.s00003908.input.s00001066 = 0
inv : -fork.s00002755.activated.s00001073 + merge.s00001162.input.s00001066 - merge.s00001162.input.s00001843 - process.s00000565__s00003960.input.s00001052 = 0
inv : callToTask.s00003969.input.s00001052 - callToTask.s00003969.input.s00001066 = 0
inv : callToTask.s00001360.inputCriterion.s00001053.used + callToTask.s00001360.output.s00001077 + callToTask.s00003981.input.s00001068 + callToTask.s00003981.inputCriterion.s00001053.used + callToTask.s00003981.output.s00001077 - fork.s00002501.activated.s00001073 + fork.s00002501.activated.s00001075 - join.s00001163.activated.s00001062 + join.s00001163.activated.s00001065 - join.s00001163.input.s00001259 = 0
inv : callToTask.s00003976.input.s00001052 - callToTask.s00003976.input.s00001066 = 0
inv : callToTask.s00003980.input.s00001052 - callToTask.s00003980.input.s00001127 = 0
inv : merge.s00001161.input.s00001052 - merge.s00001161.input.s00001128 = 0
inv : merge.s00001061.input.s00001127 - merge.s00001061.input.s00001166 = 0
inv : callToTask.s00003963.input.s00001052 - callToTask.s00003963.input.s00001066 = 0
inv : callToTask.s00003969.output.s00001077 - callToTask.s00003969.output.s00001080 = 0
inv : callToProcess.s00003859.input.s00001052 - callToProcess.s00003859.input.s00001068 = 0
inv : callToTask.s00003971.output.s00001054 - callToTask.s00003971.output.s00001077 = 0
inv : join.s00002243.input.s00001068 - join.s00002243.input.s00001263 = 0
inv : merge.s00001160.input.s00001068 - merge.s00001160.input.s00001165 = 0
inv : -fork.s00002755.activated.s00001075 + join.s00001164.activated.s00001062 - join.s00001164.activated.s00001064 + join.s00001164.input.s00001052 - join.s00001164.input.s00001127 - process.s00000565__s00003960.input.s00001052 = 0
inv : callToTask.s00003908.output.s00001054 - callToTask.s00003908.output.s00001083 = 0
inv : callToProcess.s00003876.input.s00001052 - callToProcess.s00003876.input.s00001068 = 0
inv : callToProcess.s00003872.input.s00001052 - callToProcess.s00003872.input.s00001066 = 0
inv : callToTask.s00003980.input.s00001066 - callToTask.s00003980.input.s00001127 = 0
inv : callToProcess.s00003884.input.s00001068 - callToProcess.s00003884.input.s00001127 = 0
inv : callToTask.s00001360.inputCriterion.s00001053.used + callToTask.s00001360.output.s00001054 + callToTask.s00003981.input.s00001068 + callToTask.s00003981.inputCriterion.s00001053.used + callToTask.s00003981.output.s00001077 - fork.s00002501.activated.s00001073 + fork.s00002501.activated.s00001075 - join.s00001163.activated.s00001062 + join.s00001163.activated.s00001065 - join.s00001163.input.s00001259 = 0
inv : callToTask.s00003981.input.s00001052 - callToTask.s00003981.input.s00001068 - fork.s00001403.activated.s00001075 + fork.s00001403.activated.s00001078 + fork.s00002501.activated.s00001073 - fork.s00002501.activated.s00001075 + join.s00001163.activated.s00001062 - join.s00001163.activated.s00001064 - join.s00001163.input.s00001128 + join.s00001163.input.s00001259 = 0
inv : callToProcess.s00003859.input.s00001066 - callToProcess.s00003859.input.s00001068 = 0
inv : callToTask.s00003974.output.s00001054 - callToTask.s00003974.output.s00001077 = 0
inv : fork.s00001298.input.s00001066 - fork.s00001298.input.s00001068 = 0
inv : callToProcess.s00003957.input.s00001052 - callToProcess.s00003957.input.s00001068 = 0
inv : merge.s00001061.input.s00001068 - merge.s00001061.input.s00001165 = 0
inv : callToProcess.s00003880.input.s00001052 - callToProcess.s00003880.input.s00001066 = 0
inv : callToTask.s00003973.input.s00001066 - callToTask.s00003973.input.s00001068 = 0
inv : fork.s00001403.input.s00001052 - fork.s00001403.input.s00001066 = 0
inv : callToTask.s00003908.output.s00001077 - callToTask.s00003908.output.s00001083 = 0
inv : callToTask.s00003913.output.s00001054 - callToTask.s00003913.output.s00001077 = 0
inv : callToTask.s00003965.output.s00001054 - callToTask.s00003965.output.s00001077 = 0
inv : callToProcess.s00003904.input.s00001052 - callToProcess.s00003904.input.s00001066 = 0
inv : callToProcess.s00003884.input.s00001066 - callToProcess.s00003884.input.s00001127 = 0
inv : callToTask.s00003972.input.s00001052 - callToTask.s00003972.input.s00001066 = 0
inv : fork.s00001298.input.s00001052 - fork.s00001298.input.s00001068 = 0
inv : callToTask.s00003975.input.s00001066 - callToTask.s00003975.input.s00001127 = 0
inv : callToProcess.s00003876.output.s00001054 - callToProcess.s00003876.output.s00001077 = 0
inv : merge.s00001162.input.s00001129 - merge.s00001162.input.s00001299 = 0
inv : callToTask.s00003973.input.s00001052 - callToTask.s00003973.input.s00001068 = 0
inv : callToTask.s00003968.output.s00001054 - callToTask.s00003968.output.s00001080 = 0
inv : callToTask.s00003970.input.s00001066 - callToTask.s00003970.input.s00001068 = 0
inv : callToTask.s00003981.input.s00001066 - callToTask.s00003981.input.s00001068 - fork.s00001403.activated.s00001075 + fork.s00001403.activated.s00001078 + fork.s00002501.activated.s00001073 - fork.s00002501.activated.s00001075 + join.s00001163.activated.s00001062 - join.s00001163.activated.s00001064 - join.s00001163.input.s00001128 + join.s00001163.input.s00001259 = 0
inv : callToTask.s00003971.input.s00001052 - callToTask.s00003971.input.s00001066 = 0
inv : callToTask.s00003976.output.s00001054 - callToTask.s00003976.output.s00001077 = 0
inv : 2*alpha + 2*callToProcess.s00001108.input.s00001066 + 2*callToProcess.s00001108.inputCriterion.s00001053.used + 2*callToProcess.s00001108.output.s00001077 + callToProcess.s00003872.input.s00001066 + callToProcess.s00003872.inputCriterion.s00001053.used + callToProcess.s00003872.output.s00001077 + callToProcess.s00003876.input.s00001068 + callToProcess.s00003876.inputCriterion.s00001053.used + callToProcess.s00003876.output.s00001077 + callToProcess.s00003880.input.s00001066 + callToProcess.s00003880.inputCriterion.s00001053.used + callToProcess.s00003880.output.s00001077 + callToProcess.s00003884.input.s00001127 + callToProcess.s00003884.inputCriterion.s00001053.used + callToProcess.s00003884.output.s00001083 + callToProcess.s00003957.input.s00001066 + callToProcess.s00003957.input.s00001068 + 2*callToProcess.s00003957.inputCriterion.s00001053.used + 2*callToProcess.s00003957.output.s00001080 + callToTask.s00003908.input.s00001066 + callToTask.s00003908.inputCriterion.s00001053.used + callToTask.s00003908.output.s00001083 + callToTask.s00003913.input.s00001066 + callToTask.s00003913.inputCriterion.s00001053.used + callToTask.s00003913.output.s00001077 + 2*callToTask.s00003961.inputCriterion.s00001053.used + 2*callToTask.s00003961.output.s00001080 + callToTask.s00003962.input.s00001052 + callToTask.s00003962.inputCriterion.s00001053.used + callToTask.s00003962.output.s00001080 - callToTask.s00003963.input.s00001066 - callToTask.s00003963.inputCriterion.s00001053.used - callToTask.s00003963.output.s00001054 + 2*callToTask.s00003965.input.s00001066 + 2*callToTask.s00003965.inputCriterion.s00001053.used + 2*callToTask.s00003965.output.s00001077 + callToTask.s00003966.input.s00001068 + callToTask.s00003966.inputCriterion.s00001053.used + callToTask.s00003966.output.s00001054 + callToTask.s00003968.inputCriterion.s00001053.used + callToTask.s00003968.output.s00001080 + callToTask.s00003969.input.s00001066 + callToTask.s00003969.inputCriterion.s00001053.used + callToTask.s00003969.output.s00001080 + callToTask.s00003970.input.s00001068 + callToTask.s00003970.inputCriterion.s00001053.used + callToTask.s00003970.output.s00001077 + callToTask.s00003971.input.s00001066 + callToTask.s00003971.inputCriterion.s00001053.used + callToTask.s00003971.output.s00001077 + callToTask.s00003972.input.s00001066 + callToTask.s00003972.inputCriterion.s00001053.used + callToTask.s00003972.output.s00001077 + callToTask.s00003973.input.s00001068 + callToTask.s00003973.inputCriterion.s00001053.used + callToTask.s00003973.output.s00001077 + callToTask.s00003974.inputCriterion.s00001053.used + callToTask.s00003974.output.s00001077 - callToTask.s00003975.input.s00001127 - callToTask.s00003975.inputCriterion.s00001053.used - callToTask.s00003975.output.s00001080 + callToTask.s00003976.input.s00001066 + callToTask.s00003976.inputCriterion.s00001053.used + callToTask.s00003976.output.s00001077 + callToTask.s00003978.inputCriterion.s00001053.used + callToTask.s00003978.output.s00001080 - callToTask.s00003980.output.s00001054 + callToTask.s00003980.output.s00001083 + decision.s00001123.activated + decision.s00001126.activated + decision.s00001157.activated + decision.s00001158.activated + decision.s00001159.activated + decision.s00001840.activated + decision.s00001841.activated + decision.s00002055.activated + decision.s00002056.activated - decision.s00002761.activated + 2*decision.s00002762.activated + decision.s00002948.activated + decision.s00003020.activated + decision.s00003021.activated + endNode.s00002053.input.default - fork.s00001071.activated.s00001073 + fork.s00001071.activated.s00001075 + fork.s00001298.activated.s00001073 + fork.s00001298.input.s00001068 + fork.s00001403.activated.s00001075 + fork.s00001403.input.s00001066 + fork.s00002500.activated.s00001073 + fork.s00002500.input.s00001066 + join.s00001163.activated.s00001064 + join.s00001163.input.s00001128 + join.s00002243.activated.s00001062 - join.s00002243.activated.s00001065 + join.s00002243.input.s00001127 - join.s00002243.input.s00001263 + merge.s00001061.activated + merge.s00001061.input.s00001052 + merge.s00001061.input.s00001066 + merge.s00001061.input.s00001165 + merge.s00001061.input.s00001166 + merge.s00001160.activated + merge.s00001160.input.s00001052 + merge.s00001160.input.s00001066 + merge.s00001160.input.s00001165 + merge.s00001160.input.s00001166 + merge.s00001161.activated + merge.s00001161.input.s00001128 + merge.s00001161.input.s00001129 + merge.s00002238.activated + merge.s00002238.input.s00001052 + merge.s00002238.input.s00001066 + merge.s00002240.activated + merge.s00002240.input.s00001066 + merge.s00002240.input.s00001127 + merge.s00002240.input.s00001129 - merge.s00002241.activated - process.s00000565__s00003960.output.s00001249 - process.s00000565__s00003960.outputCriterion.s00001055_omega = 2
inv : callToTask.s00003980.input.s00001068 - callToTask.s00003980.input.s00001127 = 0
inv : fork.s00002500.input.s00001052 - fork.s00002500.input.s00001066 = 0
inv : join.s00002243.input.s00001167 - join.s00002243.input.s00001263 = 0
inv : callToTask.s00003962.output.s00001054 - callToTask.s00003962.output.s00001080 = 0
inv : join.s00001163.input.s00001066 - join.s00001163.input.s00001128 = 0
inv : callToTask.s00003981.output.s00001054 - callToTask.s00003981.output.s00001077 = 0
inv : callToTask.s00003979.output.s00001054 - callToTask.s00003979.output.s00001077 = 0
inv : -callToTask.s00003961.inputCriterion.s00001053.used - callToTask.s00003961.output.s00001080 + callToTask.s00003964.input.s00001066 + callToTask.s00003964.inputCriterion.s00001053.used + callToTask.s00003964.output.s00001077 - callToTask.s00003965.input.s00001066 - callToTask.s00003965.inputCriterion.s00001053.used - callToTask.s00003965.output.s00001077 + callToTask.s00003967.inputCriterion.s00001053.used + callToTask.s00003967.output.s00001054 = 0
inv : callToTask.s00003975.input.s00001068 - callToTask.s00003975.input.s00001127 = 0
inv : callToTask.s00003977.input.s00001066 + callToTask.s00003977.inputCriterion.s00001053.used + callToTask.s00003977.output.s00001077 + callToTask.s00003979.inputCriterion.s00001053.used + callToTask.s00003979.output.s00001077 + fork.s00001403.activated.s00001073 - fork.s00001403.activated.s00001075 + fork.s00002501.activated.s00001073 + join.s00001163.activated.s00001062 - join.s00001163.activated.s00001064 - join.s00001163.input.s00001128 + join.s00001163.input.s00001259 = 0
inv : callToProcess.s00003859.output.s00001080 - callToProcess.s00003859.output.s00001083 = 0
inv : join.s00001163.input.s00001052 - join.s00001163.input.s00001259 = 0
inv : callToTask.s00003977.output.s00001054 - callToTask.s00003977.output.s00001077 = 0
inv : callToTask.s00003964.output.s00001054 - callToTask.s00003964.output.s00001077 = 0
inv : callToTask.s00003980.output.s00001080 - callToTask.s00003980.output.s00001083 = 0
inv : callToTask.s00003970.input.s00001052 - callToTask.s00003970.input.s00001068 = 0
inv : callToTask.s00003968.output.s00001077 - callToTask.s00003968.output.s00001080 = 0
inv : merge.s00002240.input.s00001068 - merge.s00002240.input.s00001129 = 0
inv : 2*alpha + 2*callToProcess.s00001108.input.s00001066 + 2*callToProcess.s00001108.inputCriterion.s00001053.used + 2*callToProcess.s00001108.output.s00001077 + callToProcess.s00003872.input.s00001066 + callToProcess.s00003872.inputCriterion.s00001053.used + callToProcess.s00003872.output.s00001077 + callToProcess.s00003876.input.s00001068 + callToProcess.s00003876.inputCriterion.s00001053.used + callToProcess.s00003876.output.s00001077 + callToProcess.s00003880.input.s00001066 + callToProcess.s00003880.inputCriterion.s00001053.used + callToProcess.s00003880.output.s00001077 + callToProcess.s00003884.input.s00001127 + callToProcess.s00003884.inputCriterion.s00001053.used + callToProcess.s00003884.output.s00001083 + callToProcess.s00003957.input.s00001066 + callToProcess.s00003957.input.s00001068 + 2*callToProcess.s00003957.inputCriterion.s00001053.used + 2*callToProcess.s00003957.output.s00001080 + callToTask.s00003908.input.s00001066 + callToTask.s00003908.inputCriterion.s00001053.used + callToTask.s00003908.output.s00001083 + callToTask.s00003913.input.s00001066 + callToTask.s00003913.inputCriterion.s00001053.used + callToTask.s00003913.output.s00001077 + 2*callToTask.s00003961.inputCriterion.s00001053.used + 2*callToTask.s00003961.output.s00001080 + callToTask.s00003962.input.s00001068 + callToTask.s00003962.inputCriterion.s00001053.used + callToTask.s00003962.output.s00001080 - callToTask.s00003963.input.s00001066 - callToTask.s00003963.inputCriterion.s00001053.used - callToTask.s00003963.output.s00001054 + 2*callToTask.s00003965.input.s00001066 + 2*callToTask.s00003965.inputCriterion.s00001053.used + 2*callToTask.s00003965.output.s00001077 + callToTask.s00003966.input.s00001068 + callToTask.s00003966.inputCriterion.s00001053.used + callToTask.s00003966.output.s00001054 + callToTask.s00003968.inputCriterion.s00001053.used + callToTask.s00003968.output.s00001080 + callToTask.s00003969.input.s00001066 + callToTask.s00003969.inputCriterion.s00001053.used + callToTask.s00003969.output.s00001080 + callToTask.s00003970.input.s00001068 + callToTask.s00003970.inputCriterion.s00001053.used + callToTask.s00003970.output.s00001077 + callToTask.s00003971.input.s00001066 + callToTask.s00003971.inputCriterion.s00001053.used + callToTask.s00003971.output.s00001077 + callToTask.s00003972.input.s00001066 + callToTask.s00003972.inputCriterion.s00001053.used + callToTask.s00003972.output.s00001077 + callToTask.s00003973.input.s00001068 + callToTask.s00003973.inputCriterion.s00001053.used + callToTask.s00003973.output.s00001077 + callToTask.s00003974.inputCriterion.s00001053.used + callToTask.s00003974.output.s00001077 - callToTask.s00003975.input.s00001127 - callToTask.s00003975.inputCriterion.s00001053.used - callToTask.s00003975.output.s00001080 + callToTask.s00003976.input.s00001066 + callToTask.s00003976.inputCriterion.s00001053.used + callToTask.s00003976.output.s00001077 + callToTask.s00003978.inputCriterion.s00001053.used + callToTask.s00003978.output.s00001080 - callToTask.s00003980.output.s00001054 + callToTask.s00003980.output.s00001083 + decision.s00001123.activated + decision.s00001126.activated + decision.s00001157.activated + decision.s00001158.activated + decision.s00001159.activated + decision.s00001840.activated + decision.s00001841.activated + decision.s00002055.activated + decision.s00002056.activated - decision.s00002761.activated + 2*decision.s00002762.activated + decision.s00002948.activated + decision.s00003020.activated + decision.s00003021.activated + endNode.s00002053.input.default - fork.s00001071.activated.s00001073 + fork.s00001071.activated.s00001075 + fork.s00001298.activated.s00001073 + fork.s00001298.input.s00001068 + fork.s00001403.activated.s00001075 + fork.s00001403.input.s00001066 + fork.s00002500.activated.s00001073 + fork.s00002500.input.s00001066 + join.s00001163.activated.s00001064 + join.s00001163.input.s00001128 + join.s00002243.activated.s00001062 - join.s00002243.activated.s00001065 + join.s00002243.input.s00001127 - join.s00002243.input.s00001263 + merge.s00001061.activated + merge.s00001061.input.s00001052 + merge.s00001061.input.s00001066 + merge.s00001061.input.s00001165 + merge.s00001061.input.s00001166 + merge.s00001160.activated + merge.s00001160.input.s00001052 + merge.s00001160.input.s00001066 + merge.s00001160.input.s00001165 + merge.s00001160.input.s00001166 + merge.s00001161.activated + merge.s00001161.input.s00001128 + merge.s00001161.input.s00001129 + merge.s00002238.activated + merge.s00002238.input.s00001052 + merge.s00002238.input.s00001066 + merge.s00002240.activated + merge.s00002240.input.s00001066 + merge.s00002240.input.s00001127 + merge.s00002240.input.s00001129 - merge.s00002241.activated - process.s00000565__s00003960.output.s00001249 - process.s00000565__s00003960.outputCriterion.s00001055_omega = 2
inv : callToTask.s00003973.output.s00001054 - callToTask.s00003973.output.s00001077 = 0
inv : merge.s00001160.input.s00001127 - merge.s00001160.input.s00001166 = 0
inv : -callToTask.s00003961.inputCriterion.s00001053.used - callToTask.s00003961.output.s00001080 + callToTask.s00003964.input.s00001052 + callToTask.s00003964.inputCriterion.s00001053.used + callToTask.s00003964.output.s00001077 - callToTask.s00003965.input.s00001066 - callToTask.s00003965.inputCriterion.s00001053.used - callToTask.s00003965.output.s00001077 + callToTask.s00003967.inputCriterion.s00001053.used + callToTask.s00003967.output.s00001054 = 0
inv : callToTask.s00003980.output.s00001077 - callToTask.s00003980.output.s00001083 = 0
inv : merge.s00002239.input.s00001052 - merge.s00002239.input.s00001068 = 0
inv : 7*alpha + callToProcess.s00003859.input.s00001068 + callToProcess.s00003859.inputCriterion.s00001053.used + callToProcess.s00003859.output.s00001083 + callToProcess.s00003904.input.s00001066 + callToProcess.s00003904.inputCriterion.s00001053.used + callToProcess.s00003904.output.s00001077 + callToTask.s00003963.input.s00001066 + callToTask.s00003963.inputCriterion.s00001053.used + callToTask.s00003963.output.s00001054 + callToTask.s00003975.input.s00001127 + callToTask.s00003975.inputCriterion.s00001053.used + callToTask.s00003975.output.s00001080 + callToTask.s00003980.input.s00001127 + callToTask.s00003980.inputCriterion.s00001053.used + callToTask.s00003980.output.s00001054 + decision.s00002760.activated + decision.s00002761.activated + endNode.s00001401.input.default + endNode.s00001402.input.default + fork.s00001071.activated.s00001073 + fork.s00002755.activated.s00001073 + fork.s00002755.activated.s00001075 + join.s00001164.activated.s00001064 + join.s00001164.input.s00001127 + join.s00002243.activated.s00001065 + join.s00002243.input.s00001263 + merge.s00001162.activated + merge.s00001162.input.s00001052 + merge.s00001162.input.s00001068 + merge.s00001162.input.s00001127 + merge.s00001162.input.s00001128 + merge.s00001162.input.s00001165 + merge.s00001162.input.s00001299 + merge.s00001162.input.s00001843 + merge.s00002239.activated + merge.s00002239.input.s00001066 + merge.s00002239.input.s00001068 + merge.s00002241.activated + 2*process.s00000565__s00003960.input.s00001052 + process.s00000565__s00003960.output.s00001249 + process.s00000565__s00003960.outputCriterion.s00001055_omega = 7
inv : callToTask.s00003969.output.s00001054 - callToTask.s00003969.output.s00001080 = 0
inv : callToTask.s00003913.input.s00001052 - callToTask.s00003913.input.s00001066 = 0
inv : callToProcess.s00003880.output.s00001054 - callToProcess.s00003880.output.s00001077 + process.s00000565__s00003960.outputCriterion.s00001055_omega = 0
inv : callToProcess.s00003859.output.s00001077 - callToProcess.s00003859.output.s00001083 = 0
inv : merge.s00001161.input.s00001066 - merge.s00001161.input.s00001129 = 0
inv : callToTask.s00003975.output.s00001054 - callToTask.s00003975.output.s00001080 = 0
inv : join.s00002243.input.s00001052 - join.s00002243.input.s00001127 = 0
inv : merge.s00001161.input.s00001127 - merge.s00001161.input.s00001129 = 0
inv : callToTask.s00003975.input.s00001052 - callToTask.s00003975.input.s00001127 = 0
inv : -fork.s00002755.activated.s00001075 + join.s00001164.input.s00001066 - join.s00001164.input.s00001127 - process.s00000565__s00003960.input.s00001052 = 0
inv : callToProcess.s00003957.output.s00001077 - callToProcess.s00003957.output.s00001080 = 0
inv : join.s00002243.input.s00001066 - join.s00002243.input.s00001166 = 0
inv : callToTask.s00003977.input.s00001052 + callToTask.s00003977.inputCriterion.s00001053.used + callToTask.s00003977.output.s00001077 + callToTask.s00003979.inputCriterion.s00001053.used + callToTask.s00003979.output.s00001077 + fork.s00001403.activated.s00001073 - fork.s00001403.activated.s00001075 + fork.s00002501.activated.s00001073 + join.s00001163.activated.s00001062 - join.s00001163.activated.s00001064 - join.s00001163.input.s00001128 + join.s00001163.input.s00001259 = 0
inv : merge.s00002240.input.s00001052 - merge.s00002240.input.s00001127 = 0
inv : merge.s00001161.input.s00001068 - merge.s00001161.input.s00001128 = 0
inv : callToTask.s00003975.output.s00001077 - callToTask.s00003975.output.s00001080 = 0
inv : callToProcess.s00003872.output.s00001054 - callToProcess.s00003872.output.s00001077 = 0
inv : callToTask.s00003965.input.s00001052 - callToTask.s00003965.input.s00001066 = 0
inv : callToTask.s00003962.output.s00001077 - callToTask.s00003962.output.s00001080 = 0
inv : callToProcess.s00003859.output.s00001054 - callToProcess.s00003859.output.s00001083 = 0
inv : callToProcess.s00003904.output.s00001054 - callToProcess.s00003904.output.s00001077 = 0
inv : 7*alpha + callToProcess.s00003859.input.s00001068 + callToProcess.s00003859.inputCriterion.s00001053.used + callToProcess.s00003859.output.s00001083 + callToProcess.s00003904.input.s00001066 + callToProcess.s00003904.inputCriterion.s00001053.used + callToProcess.s00003904.output.s00001077 + callToTask.s00003963.input.s00001066 + callToTask.s00003963.inputCriterion.s00001053.used + callToTask.s00003963.output.s00001054 + callToTask.s00003975.input.s00001127 + callToTask.s00003975.inputCriterion.s00001053.used + callToTask.s00003975.output.s00001080 + callToTask.s00003980.input.s00001127 + callToTask.s00003980.inputCriterion.s00001053.used + callToTask.s00003980.output.s00001054 + decision.s00002760.activated + decision.s00002761.activated + endNode.s00001401.input.default + endNode.s00001402.input.default + fork.s00001071.activated.s00001073 + fork.s00002755.activated.s00001073 + fork.s00002755.activated.s00001075 + join.s00001164.activated.s00001064 + join.s00001164.input.s00001127 + join.s00002243.activated.s00001065 + join.s00002243.input.s00001263 + merge.s00001162.activated + merge.s00001162.input.s00001068 + merge.s00001162.input.s00001127 + merge.s00001162.input.s00001128 + merge.s00001162.input.s00001165 + merge.s00001162.input.s00001166 + merge.s00001162.input.s00001299 + merge.s00001162.input.s00001843 + merge.s00002239.activated + merge.s00002239.input.s00001066 + merge.s00002239.input.s00001068 + merge.s00002241.activated + 2*process.s00000565__s00003960.input.s00001052 + process.s00000565__s00003960.output.s00001249 + process.s00000565__s00003960.outputCriterion.s00001055_omega = 7
Total of 101 invariants.
[2020-05-15 19:57:05] [INFO ] Computed 101 place invariants in 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3893960304334372178.txt, -o, /tmp/graph3893960304334372178.bin, -w, /tmp/graph3893960304334372178.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3893960304334372178.bin, -l, -1, -v, -w, /tmp/graph3893960304334372178.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 19:57:05] [INFO ] Decomposing Gal with order
[2020-05-15 19:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 19:57:05] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-15 19:57:05] [INFO ] Flatten gal took : 105 ms
[2020-05-15 19:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2020-05-15 19:57:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-15 19:57:05] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 15 LTL properties
Checking formula 0 : !(((!((G(X(G("(i4.u20.callToTask.s00003969.inputCriterion.s00001053.used>=1)"))))U("(i4.u20.callToTask.s00003969.inputCriterion.s00001053.used>=1)")))&&(!(F(X("(i13.i0.u65.process.s00000565__s00003960.input.s00001052>=1)"))))))
Formula 0 simplified : !(!(GXG"(i4.u20.callToTask.s00003969.inputCriterion.s00001053.used>=1)" U "(i4.u20.callToTask.s00003969.inputCriterion.s00001053.used>=1)") & !FX"(i13.i0.u65.process.s00000565__s00003960.input.s00001052>=1)")
built 18 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-15 19:57:06] [INFO ] Proved 273 variables to be positive in 436 ms
[2020-05-15 19:57:06] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2020-05-15 19:57:06] [INFO ] Computation of disable matrix completed :0/179 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 19:57:06] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 19:57:06] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2020-05-15 19:57:06] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 19:57:08] [INFO ] Computing symmetric co enabling matrix : 179 transitions.
[2020-05-15 19:57:09] [INFO ] Computation of co-enabling matrix(0/179) took 825 ms. Total solver calls (SAT/UNSAT): 127(127/0)
[2020-05-15 19:57:12] [INFO ] Computation of co-enabling matrix(4/179) took 3926 ms. Total solver calls (SAT/UNSAT): 461(459/2)
[2020-05-15 19:57:15] [INFO ] Computation of co-enabling matrix(7/179) took 7033 ms. Total solver calls (SAT/UNSAT): 830(828/2)
[2020-05-15 19:57:18] [INFO ] Computation of co-enabling matrix(11/179) took 10161 ms. Total solver calls (SAT/UNSAT): 1308(1306/2)
[2020-05-15 19:57:21] [INFO ] Computation of co-enabling matrix(20/179) took 13255 ms. Total solver calls (SAT/UNSAT): 1977(1973/4)
[2020-05-15 19:57:24] [INFO ] Computation of co-enabling matrix(23/179) took 16293 ms. Total solver calls (SAT/UNSAT): 2318(2314/4)
[2020-05-15 19:57:28] [INFO ] Computation of co-enabling matrix(26/179) took 19786 ms. Total solver calls (SAT/UNSAT): 2666(2661/5)
Reverse transition relation is NOT exact ! Due to transitions merge_s00001061_activate_s00001064, merge_s00002240_activate_s00001064, i2.merge_s00002240_activate_s00001065, i2.merge_s00002240_activate_s00001062, i5.merge_s00001061_activate_s00001067, i5.merge_s00001061_activate_s00001065, i5.i0.u60.merge.s00001061.activate.s00001062, i10.merge_s00001162_activate_s00001262, i12.i0.u33.merge.s00002241.activate.s00001062, i12.i0.u33.merge.s00002241.activate.s00001064, i12.i1.merge_s00002238_activate_s00001065, i13.i1.u67.merge.s00002239.activate.s00001062, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/166/12/178
[2020-05-15 19:57:31] [INFO ] Computation of co-enabling matrix(31/179) took 23370 ms. Total solver calls (SAT/UNSAT): 3018(3012/6)
Computing Next relation with stutter on 37987 deadlock states
[2020-05-15 19:57:34] [INFO ] Computation of co-enabling matrix(39/179) took 26417 ms. Total solver calls (SAT/UNSAT): 3622(3616/6)
[2020-05-15 19:57:37] [INFO ] Computation of co-enabling matrix(45/179) took 29533 ms. Total solver calls (SAT/UNSAT): 4189(4183/6)
[2020-05-15 19:57:40] [INFO ] Computation of co-enabling matrix(65/179) took 32566 ms. Total solver calls (SAT/UNSAT): 5378(5368/10)
[2020-05-15 19:57:44] [INFO ] Computation of co-enabling matrix(84/179) took 35743 ms. Total solver calls (SAT/UNSAT): 6708(6698/10)
[2020-05-15 19:57:47] [INFO ] Computation of co-enabling matrix(97/179) took 39025 ms. Total solver calls (SAT/UNSAT): 7327(7311/16)
[2020-05-15 19:57:50] [INFO ] Computation of co-enabling matrix(100/179) took 42452 ms. Total solver calls (SAT/UNSAT): 7514(7496/18)
[2020-05-15 19:57:53] [INFO ] Computation of co-enabling matrix(110/179) took 45550 ms. Total solver calls (SAT/UNSAT): 7959(7941/18)
[2020-05-15 19:57:56] [INFO ] Computation of co-enabling matrix(116/179) took 48570 ms. Total solver calls (SAT/UNSAT): 8184(8164/20)
[2020-05-15 19:58:00] [INFO ] Computation of co-enabling matrix(150/179) took 51610 ms. Total solver calls (SAT/UNSAT): 8802(8775/27)
[2020-05-15 19:58:01] [INFO ] Computation of Finished co-enabling matrix. took 52946 ms. Total solver calls (SAT/UNSAT): 9048(9006/42)
[2020-05-15 19:58:01] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2020-05-15 19:58:11] [INFO ] Computation of Completed DNA matrix. took 10031 ms. Total solver calls (SAT/UNSAT): 242(0/242)
[2020-05-15 19:58:11] [INFO ] Built C files in 66084ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 2547 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 93 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( ([](X([]((LTLAP0==true)))))U((LTLAP0==true))) ) && ( !( <>(X((LTLAP1==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( ([](X([]((LTLAP0==true)))))U((LTLAP0==true))) ) && ( !( <>(X((LTLAP1==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( ([](X([]((LTLAP0==true)))))U((LTLAP0==true))) ) && ( !( <>(X((LTLAP1==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-15 20:17:10] [INFO ] Flatten gal took : 38 ms
[2020-05-15 20:17:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-15 20:17:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 15 LTL properties
Checking formula 0 : !(((!((G(X(G("(callToTask.s00003969.inputCriterion.s00001053.used>=1)"))))U("(callToTask.s00003969.inputCriterion.s00001053.used>=1)")))&&(!(F(X("(process.s00000565__s00003960.input.s00001052>=1)"))))))
Formula 0 simplified : !(!(GXG"(callToTask.s00003969.inputCriterion.s00001053.used>=1)" U "(callToTask.s00003969.inputCriterion.s00001053.used>=1)") & !FX"(process.s00000565__s00003960.input.s00001052>=1)")
Detected timeout of ITS tools.
[2020-05-15 20:37:14] [INFO ] Flatten gal took : 24 ms
[2020-05-15 20:37:14] [INFO ] Input system was already deterministic with 179 transitions.
[2020-05-15 20:37:14] [INFO ] Transformed 273 places.
[2020-05-15 20:37:14] [INFO ] Transformed 179 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-15 20:37:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-15 20:37:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 15 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((!((G(X(G("(callToTask.s00003969.inputCriterion.s00001053.used>=1)"))))U("(callToTask.s00003969.inputCriterion.s00001053.used>=1)")))&&(!(F(X("(process.s00000565__s00003960.input.s00001052>=1)"))))))
Formula 0 simplified : !(!(GXG"(callToTask.s00003969.inputCriterion.s00001053.used>=1)" U "(callToTask.s00003969.inputCriterion.s00001053.used>=1)") & !FX"(process.s00000565__s00003960.input.s00001052>=1)")
Reverse transition relation is NOT exact ! Due to transitions t142, t143, t144, t145, t155, t160, t165, t167, t170, t171, t172, t174, t175, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/166/13/179
Computing Next relation with stutter on 37987 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
97006 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,970.089,5457664,1,0,413,2.89236e+07,22,405,5057,3.54276e+07,613
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBMB2S565S3960-PT-none-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((F("((merge.s00001160.input.s00001068>=1)&&(merge.s00001160.input.s00001165>=1))"))U(!((X("(((callToTask.s00003962.inputCriterion.s00001053.used>=1)&&(merge.s00001160.input.s00001068>=1))&&(merge.s00001160.input.s00001165>=1))"))U("((merge.s00001160.input.s00001068>=1)&&(merge.s00001160.input.s00001165>=1))"))))||(G("(callToTask.s00003962.inputCriterion.s00001053.used>=1)"))))
Formula 1 simplified : !((F"((merge.s00001160.input.s00001068>=1)&&(merge.s00001160.input.s00001165>=1))" U !(X"(((callToTask.s00003962.inputCriterion.s00001053.used>=1)&&(merge.s00001160.input.s00001068>=1))&&(merge.s00001160.input.s00001165>=1))" U "((merge.s00001160.input.s00001068>=1)&&(merge.s00001160.input.s00001165>=1))")) | G"(callToTask.s00003962.inputCriterion.s00001053.used>=1)")
Computing Next relation with stutter on 37987 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1632 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,986.404,5458252,1,0,417,2.89236e+07,51,409,5759,3.54276e+07,634
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IBMB2S565S3960-PT-none-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((!(G(X(G("(fork.s00001403.activated.s00001073>=1)")))))&&(F(G(("((merge.s00001160.input.s00001127>=1)&&(merge.s00001160.input.s00001166>=1))")U("(callToTask.s00003908.inputCriterion.s00001053.used>=1)"))))))
Formula 2 simplified : !(!GXG"(fork.s00001403.activated.s00001073>=1)" & FG("((merge.s00001160.input.s00001127>=1)&&(merge.s00001160.input.s00001166>=1))" U "(callToTask.s00003908.inputCriterion.s00001053.used>=1)"))
Computing Next relation with stutter on 37987 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
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 r096-oct2-158940144900346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;