fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r096-oct2-158940144900322
Last Updated
Jun 28, 2020

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15736.460 6875.00 12262.00 455.60 TFFFFTFFFTTFFFTT normal

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-158940144900322.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 IBM319-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-158940144900322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.1K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 184K Apr 27 15:14 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 IBM319-PT-none-00
FORMULA_NAME IBM319-PT-none-01
FORMULA_NAME IBM319-PT-none-02
FORMULA_NAME IBM319-PT-none-03
FORMULA_NAME IBM319-PT-none-04
FORMULA_NAME IBM319-PT-none-05
FORMULA_NAME IBM319-PT-none-06
FORMULA_NAME IBM319-PT-none-07
FORMULA_NAME IBM319-PT-none-08
FORMULA_NAME IBM319-PT-none-09
FORMULA_NAME IBM319-PT-none-10
FORMULA_NAME IBM319-PT-none-11
FORMULA_NAME IBM319-PT-none-12
FORMULA_NAME IBM319-PT-none-13
FORMULA_NAME IBM319-PT-none-14
FORMULA_NAME IBM319-PT-none-15

=== Now, execution of the tool begins

BK_START 1589572228437

[2020-05-15 19:50:32] [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:50:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 19:50:32] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2020-05-15 19:50:32] [INFO ] Transformed 253 places.
[2020-05-15 19:50:32] [INFO ] Transformed 178 transitions.
[2020-05-15 19:50:32] [INFO ] Found NUPN structural information;
[2020-05-15 19:50:32] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2020-05-15 19:50:32] [INFO ] Parsed PT model containing 253 places and 178 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2052 resets, run finished after 177 ms. (steps per millisecond=564 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 178 rows 253 cols
[2020-05-15 19:50:32] [INFO ] Computed 84 place invariants in 18 ms
[2020-05-15 19:50:33] [INFO ] [Real]Absence check using 2 positive place invariants in 33 ms returned unsat
[2020-05-15 19:50:33] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned unsat
[2020-05-15 19:50:33] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-15 19:50:33] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 20 ms returned unsat
[2020-05-15 19:50:33] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-15 19:50:33] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 35 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-15 19:50:33] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-15 19:50:33] [INFO ] Flatten gal took : 70 ms
FORMULA IBM319-PT-none-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 19:50:33] [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:50:33] [INFO ] Applying decomposition
[2020-05-15 19:50:33] [INFO ] Flatten gal took : 23 ms
[2020-05-15 19:50:34] [INFO ] Input system was already deterministic with 178 transitions.
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/graph5554607470906304024.txt, -o, /tmp/graph5554607470906304024.bin, -w, /tmp/graph5554607470906304024.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/graph5554607470906304024.bin, -l, -1, -v, -w, /tmp/graph5554607470906304024.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 178 rows 253 cols
[2020-05-15 19:50:34] [INFO ] Computed 84 place invariants in 4 ms
inv : merge_s00001161_input_s00001052 - merge_s00001161_input_s00001068 = 0
inv : -merge_s00002240_activated + merge_s00002241_activated - merge_s00002240_input_s00001052 + merge_s00002241_input_s00001052 - decision_s00001123_activated + decision_s00001126_activated - decision_s00001158_activated + decision_s00001159_activated - join_s00001164_activated_s00001062 - fork_s00001071_activated_s00001073 + join_s00001164_activated_s00001064 + fork_s00001071_activated_s00001075 - callToTask_s00001168_input_s00001052 + callToTask_s00001168_input_s00001066 + callToTask_s00002824_inputCriterion_s00001053_used - callToTask_s00001406_inputCriterion_s00001053_used - callToTask_s00002044_inputCriterion_s00001053_used - callToTask_s00002044_output_s00001077 + callToTask_s00002824_output_s00001077 + callToTask_s00002964_output_s00001077 - callToTask_s00001406_output_s00001077 + callToTask_s00002964_input_s00001066 - callToTask_s00001406_input_s00001066 + callToTask_s00002964_inputCriterion_s00001053_used + decision_s00001126_input_s00001066 - decision_s00001123_input_s00001066 + merge_s00002241_input_s00001066 - merge_s00002240_input_s00001066 - join_s00001164_input_s00001068 + join_s00001164_input_s00001066 = 0
inv : callToTask_s00002929_output_s00001054 - callToTask_s00002929_output_s00001077 = 0
inv : callToTask_s00002957_input_s00001052 - callToTask_s00002957_input_s00001066 = 0
inv : merge_s00002240_input_s00001127 - merge_s00002240_input_s00001066 = 0
inv : callToTask_s00002951_input_s00001052 - callToTask_s00002951_input_s00001066 = 0
inv : callToTask_s00002667_output_s00001054 - callToTask_s00002667_output_s00001077 = 0
inv : decision_s00001123_input_s00001052 - decision_s00001123_input_s00001066 = 0
inv : callToTask_s00002896_output_s00001054 - callToTask_s00002896_output_s00001077 = 0
inv : merge_s00001160_input_s00001129 - merge_s00001160_input_s00001068 = 0
inv : merge_s00001162_input_s00001052 - merge_s00001162_input_s00001068 = 0
inv : callToTask_s00002965_input_s00001052 - callToTask_s00002965_input_s00001066 = 0
inv : callToTask_s00002964_input_s00001052 - callToTask_s00002964_input_s00001066 = 0
inv : callToTask_s00002952_input_s00001052 - callToTask_s00002952_input_s00001066 = 0
inv : callToTask_s00002667_input_s00001052 - callToTask_s00002667_input_s00001066 = 0
inv : callToTask_s00002955_output_s00001054 - callToTask_s00002955_output_s00001077 = 0
inv : join_s00001163_input_s00001052 - join_s00001163_input_s00001127 = 0
inv : callToTask_s00002959_input_s00001052 - callToTask_s00002959_input_s00001066 = 0
inv : join_s00001163_input_s00001128 - join_s00001163_input_s00001066 = 0
inv : callToTask_s00002063_input_s00001052 - callToTask_s00002063_input_s00001066 = 0
inv : callToTask_s00002959_output_s00001054 - callToTask_s00002959_output_s00001077 = 0
inv : join_s00001164_input_s00001052 - join_s00001164_input_s00001068 = 0
inv : callToTask_s00002932_input_s00001052 - callToTask_s00002932_input_s00001066 = 0
inv : callToTask_s00002957_output_s00001054 - callToTask_s00002957_output_s00001077 = 0
inv : callToTask_s00002953_input_s00001052 - callToTask_s00002953_input_s00001066 = 0
inv : callToProcess_s00002943_output_s00001054 - callToProcess_s00002943_output_s00001077 = 0
inv : callToTask_s00002961_input_s00001052 - callToTask_s00002961_input_s00001066 = 0
inv : merge_s00001161_activated + decision_s00001841_activated + join_s00001163_activated_s00001062 - join_s00001163_activated_s00001065 + fork_s00001298_activated_s00001073 - fork_s00001298_activated_s00001078 - callToTask_s00002930_inputCriterion_s00001053_used + callToTask_s00002931_output_s00001077 - callToTask_s00002930_output_s00001077 + callToTask_s00002931_inputCriterion_s00001053_used + callToTask_s00002931_input_s00001066 - callToTask_s00002930_input_s00001066 + decision_s00001841_input_s00001066 + merge_s00001161_input_s00001068 + join_s00001163_input_s00001127 = 0
inv : alpha + merge_s00002240_activated + merge_s00001160_activated + merge_s00001061_activated + merge_s00002238_activated + merge_s00002239_activated + callToProcess_s00002882_inputCriterion_s00001053_used + callToProcess_s00002944_inputCriterion_s00001053_used + callToProcess_s00002943_inputCriterion_s00001053_used + callToProcess_s00002038_inputCriterion_s00001053_used + merge_s00002240_input_s00001052 + callToProcess_s00002802_inputCriterion_s00001053_used + 3*callToProcess_s00001108_inputCriterion_s00001053_used + callToProcess_s00002121_inputCriterion_s00001053_used + callToTask_s00002869_inputCriterion_s00001053_used + callToTask_s00002896_inputCriterion_s00001053_used + callToTask_s00002959_inputCriterion_s00001053_used + callToTask_s00002949_inputCriterion_s00001053_used + callToTask_s00002958_inputCriterion_s00001053_used + callToTask_s00002957_inputCriterion_s00001053_used + callToTask_s00002966_inputCriterion_s00001053_used + decision_s00003020_activated + decision_s00003021_activated + 3*decision_s00003022_activated + decision_s00001123_activated + decision_s00002056_activated + decision_s00001840_activated + decision_s00001157_activated + decision_s00002760_activated + decision_s00001158_activated + decision_s00002761_activated + decision_s00002762_activated + decision_s00002948_activated + join_s00001164_activated_s00001062 + fork_s00001071_activated_s00001073 + join_s00001163_activated_s00001065 + fork_s00001298_activated_s00001078 + callToTask_s00002929_inputCriterion_s00001053_used + callToTask_s00002956_inputCriterion_s00001053_used + callToTask_s00002965_inputCriterion_s00001053_used + callToTask_s00002667_inputCriterion_s00001053_used + 3*endNode_s00001401_input_default + callToTask_s00002955_inputCriterion_s00001053_used + callToTask_s00002954_inputCriterion_s00001053_used + callToTask_s00001168_input_s00001052 + callToTask_s00002963_inputCriterion_s00001053_used + callToTask_s00001168_input_s00001127 + callToTask_s00002953_inputCriterion_s00001053_used + callToTask_s00002962_inputCriterion_s00001053_used + callToTask_s00002952_inputCriterion_s00001053_used + callToTask_s00002961_inputCriterion_s00001053_used + callToTask_s00002870_inputCriterion_s00001053_used + callToTask_s00002956_input_s00001052 + callToTask_s00002951_inputCriterion_s00001053_used + callToTask_s00002960_inputCriterion_s00001053_used + 3*callToTask_s00001168_inputCriterion_s00001053_used + callToTask_s00001168_input_s00001068 + callToTask_s00001852_inputCriterion_s00001053_used + callToTask_s00002950_inputCriterion_s00001053_used + callToTask_s00002930_inputCriterion_s00001053_used + callToTask_s00002254_inputCriterion_s00001053_used + callToTask_s00001406_inputCriterion_s00001053_used + callToTask_s00002063_inputCriterion_s00001053_used + callToTask_s00002044_inputCriterion_s00001053_used + callToProcess_s00002038_output_s00001077 + callToTask_s00002869_input_s00001066 + callToTask_s00002254_output_s00001054 + callToTask_s00002044_output_s00001077 + 3*callToTask_s00001168_output_s00001054 + 3*callToProcess_s00001108_input_s00001052 + callToTask_s00002953_output_s00001077 + callToTask_s00002958_output_s00001054 + callToTask_s00002962_output_s00001077 + callToTask_s00002952_output_s00001077 + callToTask_s00002961_output_s00001077 + callToTask_s00002870_output_s00001077 + callToTask_s00002963_output_s00001077 + callToTask_s00002951_output_s00001077 + callToTask_s00002954_output_s00001077 + callToTask_s00002960_output_s00001077 + callToTask_s00001852_output_s00001077 + callToTask_s00002955_output_s00001077 + callToTask_s00002667_output_s00001077 + callToTask_s00002965_output_s00001077 + callToTask_s00002956_output_s00001077 + callToTask_s00002929_output_s00001077 + callToTask_s00002966_output_s00001077 + callToTask_s00002957_output_s00001077 + callToTask_s00002949_output_s00001077 + callToTask_s00002959_output_s00001077 + callToTask_s00002896_output_s00001077 + callToTask_s00002869_output_s00001077 + callToTask_s00002950_output_s00001077 + callToProcess_s00002499_input_s00001066 + callToTask_s00002930_output_s00001077 + callToTask_s00001406_output_s00001077 + callToProcess_s00002121_output_s00001077 + callToTask_s00002063_output_s00001077 + 3*callToProcess_s00001108_output_s00001077 + callToProcess_s00002802_output_s00001077 + callToTask_s00002959_input_s00001066 + callToTask_s00002957_input_s00001066 + callToTask_s00002966_input_s00001066 + callToTask_s00002929_input_s00001066 + process_s00000343__s00003019_output_s00001249 + callToProcess_s00002943_output_s00001077 + callToProcess_s00002944_output_s00001077 + callToProcess_s00002882_output_s00001077 + callToProcess_s00002499_output_s00001083 + callToTask_s00002965_input_s00001066 + callToTask_s00002667_input_s00001066 + callToTask_s00002954_input_s00001066 + callToTask_s00002963_input_s00001066 + callToTask_s00002953_input_s00001066 + callToTask_s00002962_input_s00001066 + callToTask_s00002952_input_s00001066 + callToTask_s00002961_input_s00001066 + callToTask_s00002951_input_s00001066 + callToTask_s00002950_input_s00001066 + callToTask_s00002960_input_s00001128 + callToTask_s00002930_input_s00001066 + callToTask_s00001406_input_s00001066 + callToTask_s00002063_input_s00001066 + decision_s00001123_input_s00001066 + merge_s00002239_input_s00001068 + merge_s00002238_input_s00001068 + merge_s00002239_input_s00001066 + merge_s00001061_input_s00001068 + merge_s00001160_input_s00001068 + merge_s00002240_input_s00001066 + merge_s00001160_input_s00001127 + join_s00001164_input_s00001068 + callToProcess_s00002499_inputCriterion_s00001053_used + 2*process_s00000343__s00003019_outputCriterion_s00001055_omega = 1
inv : callToTask_s00002954_output_s00001054 - callToTask_s00002954_output_s00001077 = 0
inv : callToTask_s00002931_input_s00001052 - callToTask_s00002931_input_s00001066 = 0
inv : merge_s00001162_activated + decision_s00002055_activated + join_s00001163_activated_s00001064 - join_s00001163_activated_s00001065 + fork_s00001298_activated_s00001075 - fork_s00001298_activated_s00001078 - callToTask_s00002930_inputCriterion_s00001053_used + callToTask_s00002932_output_s00001054 - callToTask_s00002930_output_s00001077 + callToTask_s00002932_inputCriterion_s00001053_used + callToTask_s00002932_input_s00001066 - callToTask_s00002930_input_s00001066 + decision_s00002055_input_s00001066 + merge_s00001162_input_s00001068 + join_s00001163_input_s00001066 = 0
inv : callToTask_s00002950_input_s00001052 - callToTask_s00002950_input_s00001066 = 0
inv : merge_s00002238_input_s00001052 - merge_s00002238_input_s00001068 = 0
inv : callToTask_s00002930_input_s00001052 - callToTask_s00002930_input_s00001066 = 0
inv : merge_s00001162_activated + decision_s00002055_activated + join_s00001163_activated_s00001064 - join_s00001163_activated_s00001065 + fork_s00001298_activated_s00001075 - fork_s00001298_activated_s00001078 - callToTask_s00002930_inputCriterion_s00001053_used + callToTask_s00002932_output_s00001077 - callToTask_s00002930_output_s00001077 + callToTask_s00002932_inputCriterion_s00001053_used + callToTask_s00002932_input_s00001066 - callToTask_s00002930_input_s00001066 + decision_s00002055_input_s00001066 + merge_s00001162_input_s00001068 + join_s00001163_input_s00001066 = 0
inv : callToTask_s00002869_output_s00001054 - callToTask_s00002869_output_s00001077 = 0
inv : callToTask_s00002950_output_s00001054 - callToTask_s00002950_output_s00001077 = 0
inv : callToTask_s00002966_input_s00001052 - callToTask_s00002966_input_s00001066 = 0
inv : callToTask_s00002961_output_s00001054 - callToTask_s00002961_output_s00001077 = 0
inv : -merge_s00002240_activated + merge_s00002241_activated - merge_s00002240_input_s00001052 + merge_s00002241_input_s00001052 - decision_s00001123_activated + decision_s00001126_activated - decision_s00001158_activated + decision_s00001159_activated - join_s00001164_activated_s00001062 - fork_s00001071_activated_s00001073 + join_s00001164_activated_s00001064 + fork_s00001071_activated_s00001075 + decision_s00001126_input_s00001052 - callToTask_s00001168_input_s00001052 + callToTask_s00001168_input_s00001066 + callToTask_s00002824_inputCriterion_s00001053_used - callToTask_s00001406_inputCriterion_s00001053_used - callToTask_s00002044_inputCriterion_s00001053_used - callToTask_s00002044_output_s00001077 + callToTask_s00002824_output_s00001077 + callToTask_s00002964_output_s00001077 - callToTask_s00001406_output_s00001077 + callToTask_s00002964_input_s00001066 - callToTask_s00001406_input_s00001066 + callToTask_s00002964_inputCriterion_s00001053_used - decision_s00001123_input_s00001066 + merge_s00002241_input_s00001066 - merge_s00002240_input_s00001066 - join_s00001164_input_s00001068 + join_s00001164_input_s00001066 = 0
inv : merge_s00002241_input_s00001127 - merge_s00002241_input_s00001066 = 0
inv : callToTask_s00001852_output_s00001054 - callToTask_s00001852_output_s00001077 = 0
inv : callToTask_s00002951_output_s00001054 - callToTask_s00002951_output_s00001077 = 0
inv : callToTask_s00002965_output_s00001054 - callToTask_s00002965_output_s00001077 = 0
inv : merge_s00002239_input_s00001129 - merge_s00002239_input_s00001068 = 0
inv : decision_s00002055_input_s00001052 - decision_s00002055_input_s00001066 = 0
inv : callToTask_s00001406_input_s00001052 - callToTask_s00001406_input_s00001066 = 0
inv : callToTask_s00002960_input_s00001127 - callToTask_s00002960_input_s00001128 = 0
inv : callToTask_s00002954_input_s00001052 - callToTask_s00002954_input_s00001066 = 0
inv : endNode_s00001057_input_default - process_s00000343__s00003019_output_s00001249 - process_s00000343__s00003019_outputCriterion_s00001055_omega = 0
inv : merge_s00001061_input_s00001052 - merge_s00001061_input_s00001068 = 0
inv : merge_s00002239_input_s00001128 - merge_s00002239_input_s00001066 = 0
inv : callToProcess_s00002121_output_s00001054 - callToProcess_s00002121_output_s00001077 = 0
inv : callToTask_s00002960_output_s00001054 - callToTask_s00002960_output_s00001077 = 0
inv : callToTask_s00002956_output_s00001054 - callToTask_s00002956_output_s00001077 = 0
inv : callToTask_s00002929_input_s00001052 - callToTask_s00002929_input_s00001066 = 0
inv : callToTask_s00002962_input_s00001052 - callToTask_s00002962_input_s00001066 = 0
inv : callToTask_s00002964_output_s00001054 - callToTask_s00002964_output_s00001077 = 0
inv : callToTask_s00002870_output_s00001054 - callToTask_s00002870_output_s00001077 = 0
inv : callToTask_s00001406_output_s00001054 - callToTask_s00001406_output_s00001077 = 0
inv : callToProcess_s00002944_output_s00001054 - callToProcess_s00002944_output_s00001077 = 0
inv : callToTask_s00002063_output_s00001054 - callToTask_s00002063_output_s00001077 = 0
inv : merge_s00001160_input_s00001052 - merge_s00001160_input_s00001127 = 0
inv : callToTask_s00002952_output_s00001054 - callToTask_s00002952_output_s00001077 = 0
inv : callToTask_s00002930_output_s00001054 - callToTask_s00002930_output_s00001077 = 0
inv : merge_s00001161_activated + decision_s00001841_activated + join_s00001163_activated_s00001062 - join_s00001163_activated_s00001065 + fork_s00001298_activated_s00001073 - fork_s00001298_activated_s00001078 - callToTask_s00002930_inputCriterion_s00001053_used + callToTask_s00002931_output_s00001054 - callToTask_s00002930_output_s00001077 + callToTask_s00002931_inputCriterion_s00001053_used + callToTask_s00002931_input_s00001066 - callToTask_s00002930_input_s00001066 + decision_s00001841_input_s00001066 + merge_s00001161_input_s00001068 + join_s00001163_input_s00001127 = 0
inv : callToProcess_s00002802_output_s00001054 - callToProcess_s00002802_output_s00001077 = 0
inv : callToProcess_s00001108_output_s00001054 - callToProcess_s00001108_output_s00001077 + process_s00000343__s00003019_outputCriterion_s00001055_omega = 0
inv : callToTask_s00002960_input_s00001066 - callToTask_s00002960_input_s00001128 = 0
inv : callToProcess_s00002882_output_s00001054 - callToProcess_s00002882_output_s00001077 = 0
inv : callToTask_s00002966_output_s00001054 - callToTask_s00002966_output_s00001077 = 0
inv : decision_s00001841_input_s00001052 - decision_s00001841_input_s00001066 = 0
inv : alpha + merge_s00002240_activated + merge_s00001160_activated + merge_s00001061_activated + merge_s00002238_activated + merge_s00002239_activated + callToProcess_s00002882_inputCriterion_s00001053_used + callToProcess_s00002944_inputCriterion_s00001053_used + callToProcess_s00002943_inputCriterion_s00001053_used + callToProcess_s00002038_inputCriterion_s00001053_used + merge_s00002240_input_s00001052 + callToProcess_s00002802_inputCriterion_s00001053_used + 3*callToProcess_s00001108_inputCriterion_s00001053_used + callToProcess_s00002121_inputCriterion_s00001053_used + callToTask_s00002869_inputCriterion_s00001053_used + callToTask_s00002896_inputCriterion_s00001053_used + callToTask_s00002959_inputCriterion_s00001053_used + callToTask_s00002949_inputCriterion_s00001053_used + callToTask_s00002958_inputCriterion_s00001053_used + callToTask_s00002957_inputCriterion_s00001053_used + callToTask_s00002966_inputCriterion_s00001053_used + decision_s00003020_activated + decision_s00003021_activated + 3*decision_s00003022_activated + decision_s00001123_activated + decision_s00002056_activated + decision_s00001840_activated + decision_s00001157_activated + decision_s00002760_activated + decision_s00001158_activated + decision_s00002761_activated + decision_s00002762_activated + decision_s00002948_activated + join_s00001164_activated_s00001062 + fork_s00001071_activated_s00001073 + join_s00001163_activated_s00001065 + fork_s00001298_activated_s00001078 + callToTask_s00002929_inputCriterion_s00001053_used + callToTask_s00002956_inputCriterion_s00001053_used + callToTask_s00002965_inputCriterion_s00001053_used + callToTask_s00002667_inputCriterion_s00001053_used + 3*endNode_s00001401_input_default + callToTask_s00002955_inputCriterion_s00001053_used + callToTask_s00002954_inputCriterion_s00001053_used + callToTask_s00001168_input_s00001052 + callToTask_s00002963_inputCriterion_s00001053_used + callToTask_s00001168_input_s00001127 + callToTask_s00002953_inputCriterion_s00001053_used + callToTask_s00002962_inputCriterion_s00001053_used + callToTask_s00002952_inputCriterion_s00001053_used + callToTask_s00002961_inputCriterion_s00001053_used + callToTask_s00002870_inputCriterion_s00001053_used + callToTask_s00002951_inputCriterion_s00001053_used + callToTask_s00002960_inputCriterion_s00001053_used + 3*callToTask_s00001168_inputCriterion_s00001053_used + callToTask_s00001168_input_s00001068 + callToTask_s00001852_inputCriterion_s00001053_used + callToTask_s00002950_inputCriterion_s00001053_used + callToTask_s00002930_inputCriterion_s00001053_used + callToTask_s00002254_inputCriterion_s00001053_used + callToTask_s00001406_inputCriterion_s00001053_used + callToTask_s00002063_inputCriterion_s00001053_used + callToTask_s00002044_inputCriterion_s00001053_used + callToProcess_s00002038_output_s00001077 + callToTask_s00002869_input_s00001066 + callToTask_s00002254_output_s00001054 + callToTask_s00002044_output_s00001077 + 3*callToTask_s00001168_output_s00001054 + 3*callToProcess_s00001108_input_s00001052 + callToTask_s00002953_output_s00001077 + callToTask_s00002958_output_s00001054 + callToTask_s00002962_output_s00001077 + callToTask_s00002952_output_s00001077 + callToTask_s00002961_output_s00001077 + callToTask_s00002870_output_s00001077 + callToTask_s00002963_output_s00001077 + callToTask_s00002951_output_s00001077 + callToTask_s00002954_output_s00001077 + callToTask_s00002960_output_s00001077 + callToTask_s00001852_output_s00001077 + callToTask_s00002955_output_s00001077 + callToTask_s00002667_output_s00001077 + callToTask_s00002965_output_s00001077 + callToTask_s00002956_output_s00001077 + callToTask_s00002929_output_s00001077 + callToTask_s00002966_output_s00001077 + callToTask_s00002957_output_s00001077 + callToTask_s00002949_output_s00001077 + callToTask_s00002959_output_s00001077 + callToTask_s00002896_output_s00001077 + callToTask_s00002869_output_s00001077 + callToTask_s00002950_output_s00001077 + callToProcess_s00002499_input_s00001066 + callToTask_s00002930_output_s00001077 + callToTask_s00001406_output_s00001077 + callToProcess_s00002121_output_s00001077 + callToTask_s00002063_output_s00001077 + 3*callToProcess_s00001108_output_s00001077 + callToProcess_s00002802_output_s00001077 + callToTask_s00002959_input_s00001066 + callToTask_s00002957_input_s00001066 + callToTask_s00002966_input_s00001066 + callToTask_s00002929_input_s00001066 + process_s00000343__s00003019_output_s00001249 + callToProcess_s00002943_output_s00001077 + callToProcess_s00002944_output_s00001077 + callToTask_s00002956_input_s00001066 + callToProcess_s00002882_output_s00001077 + callToProcess_s00002499_output_s00001083 + callToTask_s00002965_input_s00001066 + callToTask_s00002667_input_s00001066 + callToTask_s00002954_input_s00001066 + callToTask_s00002963_input_s00001066 + callToTask_s00002953_input_s00001066 + callToTask_s00002962_input_s00001066 + callToTask_s00002952_input_s00001066 + callToTask_s00002961_input_s00001066 + callToTask_s00002951_input_s00001066 + callToTask_s00002950_input_s00001066 + callToTask_s00002960_input_s00001128 + callToTask_s00002930_input_s00001066 + callToTask_s00001406_input_s00001066 + callToTask_s00002063_input_s00001066 + decision_s00001123_input_s00001066 + merge_s00002239_input_s00001068 + merge_s00002238_input_s00001068 + merge_s00002239_input_s00001066 + merge_s00001061_input_s00001068 + merge_s00001160_input_s00001068 + merge_s00002240_input_s00001066 + merge_s00001160_input_s00001127 + join_s00001164_input_s00001068 + callToProcess_s00002499_inputCriterion_s00001053_used + 2*process_s00000343__s00003019_outputCriterion_s00001055_omega = 1
inv : join_s00001164_input_s00001127 - join_s00001164_input_s00001066 = 0
inv : fork_s00001403_activated_s00001075 + callToTask_s00002960_input_s00001052 + process_s00000343__s00003019_input_s00001109 - callToTask_s00002960_input_s00001128 = 0
inv : callToTask_s00002963_output_s00001054 - callToTask_s00002963_output_s00001077 = 0
inv : callToTask_s00002962_output_s00001054 - callToTask_s00002962_output_s00001077 = 0
inv : callToTask_s00002960_input_s00001068 - callToTask_s00002960_input_s00001128 = 0
inv : callToTask_s00002963_input_s00001052 - callToTask_s00002963_input_s00001066 = 0
inv : callToProcess_s00002499_input_s00001052 - callToProcess_s00002499_input_s00001066 = 0
inv : callToProcess_s00002499_output_s00001054 - callToProcess_s00002499_output_s00001083 = 0
inv : callToTask_s00002958_output_s00001077 - callToTask_s00002958_output_s00001054 - process_s00000343__s00003019_outputCriterion_s00001055_omega = 0
inv : callToTask_s00002949_output_s00001054 - callToTask_s00002949_output_s00001077 = 0
Total of 84 invariants.
[2020-05-15 19:50:34] [INFO ] Computed 84 place invariants in 6 ms
[2020-05-15 19:50:34] [INFO ] Decomposing Gal with order
[2020-05-15 19:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 19:50:34] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-15 19:50:34] [INFO ] Flatten gal took : 109 ms
[2020-05-15 19:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-15 19:50:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-15 19:50:34] [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 12 LTL properties
Checking formula 0 : !((!(X(((F("((i12.i1.u32.decision_s00001123_input_s00001052==1)&&(i12.i1.u32.decision_s00001123_input_s00001066==1))"))&&("(i13.i1.u51.callToTask_s00002965_input_s00001052==1)"))&&("(i13.i1.u51.callToTask_s00002965_input_s00001066==1)")))))
Formula 0 simplified : X("(i13.i1.u51.callToTask_s00002965_input_s00001052==1)" & "(i13.i1.u51.callToTask_s00002965_input_s00001066==1)" & F"((i12.i1.u32.decision_s00001123_input_s00001052==1)&&(i12.i1.u32.decision_s00001123_input_s00001066==1))")
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 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.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.i1.merge_s00001061_activate_s00001062, i0.i1.merge_s00001061_activate_s00001064, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :8/168/2/178
Computing Next relation with stutter on 20 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
4 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,0.077852,19240,1,0,3455,299,2270,3943,469,653,12498
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IBM319-PT-none-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(G("(i12.i1.u58.callToTask_s00001406_inputCriterion_s00001053_used==1)")))&&(!(F(X(F("((i10.u54.callToTask_s00002966_input_s00001052!=1)||(i10.u54.callToTask_s00002966_input_s00001066!=1))")))))))
Formula 1 simplified : !(!G"(i12.i1.u58.callToTask_s00001406_inputCriterion_s00001053_used==1)" & !FXF"((i10.u54.callToTask_s00002966_input_s00001052!=1)||(i10.u54.callToTask_s00002966_input_s00001066!=1))")
Computing Next relation with stutter on 20 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 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,0.130348,22440,1,0,11391,388,2947,14040,499,974,34217
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM319-PT-none-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(!(X(F(X(F(G(F("((i9.i3.u53.callToTask_s00002951_input_s00001052==1)&&(i9.i3.u53.callToTask_s00002951_input_s00001066==1))")))))))))))
Formula 2 simplified : X!XFXFGF"((i9.i3.u53.callToTask_s00002951_input_s00001052==1)&&(i9.i3.u53.callToTask_s00002951_input_s00001066==1))"
Computing Next relation with stutter on 20 deadlock states
133 unique states visited
133 strongly connected components in search stack
134 transitions explored
133 items max in DFS search stack
8 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,0.215648,26364,1,0,18679,531,2981,28438,500,1443,54603
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM319-PT-none-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(F(F((("(i0.i0.u0.alpha==1)")U("(i11.i2.u18.merge_s00002239_activated==1)"))||("(i11.i2.u18.merge_s00002239_activated==1)")))))))
Formula 3 simplified : !XGF("(i11.i2.u18.merge_s00002239_activated==1)" | ("(i0.i0.u0.alpha==1)" U "(i11.i2.u18.merge_s00002239_activated==1)"))
Computing Next relation with stutter on 20 deadlock states
133 unique states visited
133 strongly connected components in search stack
134 transitions explored
133 items max in DFS search stack
1 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,0.225395,27108,1,0,20668,531,3011,30126,500,1443,58753
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM319-PT-none-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X((G(F("((i13.i2.u61.callToProcess_s00002882_output_s00001054==1)&&(i13.i1.u4.callToProcess_s00002882_output_s00001077==1))")))&&(G("((i3.i0.u38.callToTask_s00001852_output_s00001054==1)&&(i3.i0.u38.callToTask_s00001852_output_s00001077==1))"))))))
Formula 4 simplified : !FX(GF"((i13.i2.u61.callToProcess_s00002882_output_s00001054==1)&&(i13.i1.u4.callToProcess_s00002882_output_s00001077==1))" & G"((i3.i0.u38.callToTask_s00001852_output_s00001054==1)&&(i3.i0.u38.callToTask_s00001852_output_s00001077==1))")
Computing Next relation with stutter on 20 deadlock states
23 unique states visited
23 strongly connected components in search stack
23 transitions explored
23 items max in DFS search stack
1 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,0.237584,28348,1,0,22399,531,3104,32133,503,1443,65439
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM319-PT-none-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(X(!(F((F("(((i9.i1.u22.merge_s00001160_input_s00001129!=1)||(i9.i1.u22.merge_s00001160_input_s00001068!=1))&&(i12.i1.u32.decision_s00001123_activated==1))"))U("((i9.i1.u22.merge_s00001160_input_s00001129==1)&&(i9.i1.u22.merge_s00001160_input_s00001068==1))"))))))))
Formula 5 simplified : !GFX!F(F"(((i9.i1.u22.merge_s00001160_input_s00001129!=1)||(i9.i1.u22.merge_s00001160_input_s00001068!=1))&&(i12.i1.u32.decision_s00001123_activated==1))" U "((i9.i1.u22.merge_s00001160_input_s00001129==1)&&(i9.i1.u22.merge_s00001160_input_s00001068==1))")
Computing Next relation with stutter on 20 deadlock states
[2020-05-15 19:50:34] [INFO ] Proved 253 variables to be positive in 531 ms
[2020-05-15 19:50:34] [INFO ] Computing symmetric may disable matrix : 178 transitions.
[2020-05-15 19:50:34] [INFO ] Computation of disable matrix completed :0/178 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 19:50:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 19:50:34] [INFO ] Computing symmetric may enable matrix : 178 transitions.
[2020-05-15 19:50:34] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
261 unique states visited
0 strongly connected components in search stack
262 transitions explored
132 items max in DFS search stack
8 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,0.315524,29652,1,0,24476,531,3131,38343,503,1443,75955
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IBM319-PT-none-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(!((F("((i10.u7.callToTask_s00002966_output_s00001054==1)&&(i10.u7.callToTask_s00002966_output_s00001077==1))"))U("((((i9.i0.u45.callToTask_s00002963_output_s00001054==1)&&(i9.i0.u45.callToTask_s00002963_output_s00001077==1))||(i11.i0.u41.callToTask_s00002954_output_s00001054!=1))||(i11.i0.u41.callToTask_s00002954_output_s00001077!=1))")))))
Formula 6 simplified : !F!(F"((i10.u7.callToTask_s00002966_output_s00001054==1)&&(i10.u7.callToTask_s00002966_output_s00001077==1))" U "((((i9.i0.u45.callToTask_s00002963_output_s00001054==1)&&(i9.i0.u45.callToTask_s00002963_output_s00001077==1))||(i11.i0.u41.callToTask_s00002954_output_s00001054!=1))||(i11.i0.u41.callToTask_s00002954_output_s00001077!=1))")
Computing Next relation with stutter on 20 deadlock states
125 unique states visited
125 strongly connected components in search stack
125 transitions explored
125 items max in DFS search stack
4 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,0.358082,31448,1,0,27492,532,3207,43069,508,1466,87842
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM319-PT-none-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X((!(G("(i12.i1.u60.callToTask_s00002044_output_s00001077==1)")))||(G("((i1.i2.u50.decision_s00001159_activated==1)&&(i12.i1.u60.callToTask_s00002044_output_s00001077==1))"))))))
Formula 7 simplified : X(!G"(i12.i1.u60.callToTask_s00002044_output_s00001077==1)" | G"((i1.i2.u50.decision_s00001159_activated==1)&&(i12.i1.u60.callToTask_s00002044_output_s00001077==1))")
Computing Next relation with stutter on 20 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 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,0.359702,31844,1,0,27492,532,3227,43069,508,1466,87880
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM319-PT-none-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((!(("((i7.u29.callToTask_s00002930_output_s00001054==1)&&(i7.u29.callToTask_s00002930_output_s00001077==1))")U("((i12.i0.u27.join_s00001164_input_s00001052==1)&&(i12.i0.u27.join_s00001164_input_s00001068==1))")))&&("((i12.i0.u27.join_s00001164_input_s00001052!=1)||(i12.i0.u27.join_s00001164_input_s00001068!=1))"))))
Formula 8 simplified : !G("((i12.i0.u27.join_s00001164_input_s00001052!=1)||(i12.i0.u27.join_s00001164_input_s00001068!=1))" & !("((i7.u29.callToTask_s00002930_output_s00001054==1)&&(i7.u29.callToTask_s00002930_output_s00001077==1))" U "((i12.i0.u27.join_s00001164_input_s00001052==1)&&(i12.i0.u27.join_s00001164_input_s00001068==1))"))
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 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,0.368669,32044,1,0,28955,532,3289,44666,513,1466,91625
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM319-PT-none-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((F((X("(i9.i1.u47.callToTask_s00002952_inputCriterion_s00001053_used==1)"))&&("(i9.i1.u47.callToTask_s00002952_inputCriterion_s00001053_used!=1)")))||((X("((i3.i1.u59.callToTask_s00002063_output_s00001054==1)&&(i3.i1.u59.callToTask_s00002063_output_s00001077==1))"))&&(!(G("((i13.i1.u4.callToTask_s00002965_output_s00001054==1)&&(i13.i1.u51.callToTask_s00002965_output_s00001077==1))")))))))
Formula 9 simplified : !X(F("(i9.i1.u47.callToTask_s00002952_inputCriterion_s00001053_used!=1)" & X"(i9.i1.u47.callToTask_s00002952_inputCriterion_s00001053_used==1)") | (X"((i3.i1.u59.callToTask_s00002063_output_s00001054==1)&&(i3.i1.u59.callToTask_s00002063_output_s00001077==1))" & !G"((i13.i1.u4.callToTask_s00002965_output_s00001054==1)&&(i13.i1.u51.callToTask_s00002965_output_s00001077==1))"))
Computing Next relation with stutter on 20 deadlock states
121 unique states visited
121 strongly connected components in search stack
121 transitions explored
121 items max in DFS search stack
2 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,0.392744,33952,1,0,31853,532,3357,48173,517,1466,101305
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM319-PT-none-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(((!(F("((i3.i1.u11.callToProcess_s00002802_inputCriterion_s00001053_used==1)||((i9.i1.u52.callToTask_s00002956_output_s00001054==1)&&(i9.i2.u44.callToTask_s00002956_output_s00001077==1)))")))&&("(i9.i1.u52.callToTask_s00002956_output_s00001054==1)"))&&("(i9.i2.u44.callToTask_s00002956_output_s00001077==1)")))U(F(G((F("(i3.i1.u11.callToProcess_s00002802_inputCriterion_s00001053_used==1)"))||("(i3.i1.u11.callToProcess_s00002802_inputCriterion_s00001053_used==1)"))))))
Formula 10 simplified : !(F("(i9.i1.u52.callToTask_s00002956_output_s00001054==1)" & "(i9.i2.u44.callToTask_s00002956_output_s00001077==1)" & !F"((i3.i1.u11.callToProcess_s00002802_inputCriterion_s00001053_used==1)||((i9.i1.u52.callToTask_s00002956_output_s00001054==1)&&(i9.i2.u44.callToTask_s00002956_output_s00001077==1)))") U FG("(i3.i1.u11.callToProcess_s00002802_inputCriterion_s00001053_used==1)" | F"(i3.i1.u11.callToProcess_s00002802_inputCriterion_s00001053_used==1)"))
Computing Next relation with stutter on 20 deadlock states
133 unique states visited
133 strongly connected components in search stack
134 transitions explored
133 items max in DFS search stack
1 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,0.40224,34788,1,0,32953,532,3373,49258,517,1468,104465
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM319-PT-none-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(!(X(F("(i9.i3.u21.decision_s00003020_activated==1)")))))U((F("(i0.i2.u43.fork_s00001403_activated_s00001075==1)"))||("(i9.i3.u21.decision_s00003020_activated==1)"))))
Formula 11 simplified : !(X!XF"(i9.i3.u21.decision_s00003020_activated==1)" U ("(i9.i3.u21.decision_s00003020_activated==1)" | F"(i0.i2.u43.fork_s00001403_activated_s00001075==1)"))
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 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,0.403288,35044,1,0,32953,532,3404,49258,517,1468,104546
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA IBM319-PT-none-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-15 19:50:34] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 104) 1) (>= (select s0 211) 1)) (= (store (store (store s0 211 (- (select s0 211) 1)) 104 (- (select s0 104) 1)) 73 (+ (select s0 73) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 104) 1) (>= (select s0 211) 1)) (= (store (store (store s0 211 (- (select s0 211) 1)) 104 (- (select s0 104) 1)) 73 (+ (select s0 73) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 19:50:34] [INFO ] Built C files in 1007ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589572235312

--------------------
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="IBM319-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 IBM319-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-158940144900322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-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 ;