Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 37K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 184K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1620837472762

Running Version 0
[2021-05-12 16:37:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:37:54] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-12 16:37:54] [INFO ] Transformed 253 places.
[2021-05-12 16:37:54] [INFO ] Transformed 178 transitions.
[2021-05-12 16:37:54] [INFO ] Found NUPN structural information;
[2021-05-12 16:37:54] [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]
[2021-05-12 16:37:54] [INFO ] Parsed PT model containing 253 places and 178 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:37:54] [INFO ] Initial state test concluded for 2 properties.
Support contains 47 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 64 places
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 181 transition count 178
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 171 transition count 168
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 171 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 171 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 169 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 169 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 168 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 168 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 167 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 167 transition count 163
Applied a total of 101 rules in 517 ms. Remains 167 /253 variables (removed 86) and now considering 163/178 (removed 15) transitions.
// Phase 1: matrix 163 rows 167 cols
[2021-05-12 16:37:55] [INFO ] Computed 16 place invariants in 12 ms
[2021-05-12 16:37:55] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 163 rows 167 cols
[2021-05-12 16:37:55] [INFO ] Computed 16 place invariants in 12 ms
[2021-05-12 16:37:55] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 167 cols
[2021-05-12 16:37:55] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-12 16:37:56] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 1 iterations. Remains : 167/253 places, 163/178 transitions.
[2021-05-12 16:37:56] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-12 16:37:56] [INFO ] Flatten gal took : 85 ms
FORMULA IBM319-PT-none-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:37:56] [INFO ] Flatten gal took : 33 ms
[2021-05-12 16:37:56] [INFO ] Input system was already deterministic with 163 transitions.
Incomplete random walk after 100000 steps, including 2036 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 24) seen :18
Running SMT prover for 6 properties.
// Phase 1: matrix 163 rows 167 cols
[2021-05-12 16:37:56] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-12 16:37:56] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-12 16:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-12 16:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-12 16:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using state equation in 60 ms returned unsat
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-12 16:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-12 16:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:57] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA IBM319-PT-none-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 12 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 154 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 152 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 152 transition count 161
Applied a total of 17 rules in 11 ms. Remains 152 /167 variables (removed 15) and now considering 161/163 (removed 2) transitions.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:57] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 16:37:57] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:57] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:57] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/167 places, 161/163 transitions.
Stuttering acceptance computed with spot in 339 ms :[p0, p0, p0, true]
Running random walk in product with property : IBM319-PT-none-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA IBM319-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-02 finished in 632 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||F(p1)) U (G((p0||F(p1)))||((p0||F(p1))&&(p2||F(p3)||G(p4)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 11 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 155 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 153 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 153 transition count 161
Applied a total of 16 rules in 9 ms. Remains 153 /167 variables (removed 14) and now considering 161/163 (removed 2) transitions.
// Phase 1: matrix 161 rows 153 cols
[2021-05-12 16:37:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:37:58] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 161 rows 153 cols
[2021-05-12 16:37:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:37:58] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 153 cols
[2021-05-12 16:37:58] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-12 16:37:58] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/167 places, 161/163 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : IBM319-PT-none-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p4), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) p4), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) p4 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p4) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s73 0), p1:(OR (NEQ s68 1) (NEQ s121 1)), p2:(NEQ s73 1), p3:(NEQ s36 1), p4:(NEQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 153 transition count 161
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (F (G p2)), (F (G p3)), (F (G p4)), (NOT p0), p1, p2, p3, p4]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA IBM319-PT-none-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-04 finished in 1097 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 155 transition count 63
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 105 rules applied. Total rules applied 204 place count 56 transition count 57
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 209 place count 52 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 210 place count 51 transition count 56
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 210 place count 51 transition count 40
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 244 place count 33 transition count 40
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 246 place count 32 transition count 39
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 248 place count 31 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 248 place count 31 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 255 place count 27 transition count 35
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 273 place count 18 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 277 place count 18 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 279 place count 17 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 283 place count 15 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 284 place count 15 transition count 24
Applied a total of 284 rules in 23 ms. Remains 15 /167 variables (removed 152) and now considering 24/163 (removed 139) transitions.
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 16:37:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:37:59] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 16:37:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:37:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-12 16:37:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 16:37:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 16:37:59] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/167 places, 24/163 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM319-PT-none-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s6 1), p0:(OR (NEQ s7 1) (NEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32910 reset in 162 ms.
Product exploration explored 100000 steps with 32948 reset in 172 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), p1, p0]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA IBM319-PT-none-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-05 finished in 545 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 12 places
Reduce places removed 13 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 154 transition count 62
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 108 rules applied. Total rules applied 208 place count 54 transition count 54
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 215 place count 49 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 217 place count 47 transition count 52
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 217 place count 47 transition count 36
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 250 place count 30 transition count 36
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 253 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 255 place count 27 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 255 place count 27 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 260 place count 24 transition count 32
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 276 place count 16 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 280 place count 16 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 282 place count 15 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 284 place count 14 transition count 17
Applied a total of 284 rules in 10 ms. Remains 14 /167 variables (removed 153) and now considering 17/163 (removed 146) transitions.
// Phase 1: matrix 17 rows 14 cols
[2021-05-12 16:37:59] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:37:59] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 17 rows 14 cols
[2021-05-12 16:37:59] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:37:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-12 16:37:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 14 cols
[2021-05-12 16:37:59] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:37:59] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/167 places, 17/163 transitions.
Stuttering acceptance computed with spot in 3479 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (OR (EQ s3 0) (EQ s0 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-09 finished in 3547 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 155 transition count 63
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 105 rules applied. Total rules applied 204 place count 56 transition count 57
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 209 place count 52 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 210 place count 51 transition count 56
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 210 place count 51 transition count 39
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 245 place count 33 transition count 39
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 247 place count 32 transition count 38
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 249 place count 31 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 249 place count 31 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 254 place count 28 transition count 35
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 272 place count 19 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 275 place count 19 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 279 place count 17 transition count 24
Applied a total of 279 rules in 29 ms. Remains 17 /167 variables (removed 150) and now considering 24/163 (removed 139) transitions.
// Phase 1: matrix 24 rows 17 cols
[2021-05-12 16:38:03] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:38:03] [INFO ] Implicit Places using invariants in 43 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
[2021-05-12 16:38:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 16 cols
[2021-05-12 16:38:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 16:38:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 16/167 places, 24/163 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 29
Applied a total of 2 rules in 3 ms. Remains 15 /16 variables (removed 1) and now considering 29/24 (removed -5) transitions.
// Phase 1: matrix 29 rows 15 cols
[2021-05-12 16:38:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:38:03] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 29 rows 15 cols
[2021-05-12 16:38:03] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-12 16:38:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/167 places, 29/163 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 0) (OR (EQ s8 0) (EQ s10 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 38040 reset in 196 ms.
Product exploration explored 100000 steps with 38254 reset in 207 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 29
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM319-PT-none-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-10 finished in 643 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 12 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 154 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 152 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 152 transition count 161
Applied a total of 17 rules in 9 ms. Remains 152 /167 variables (removed 15) and now considering 161/163 (removed 2) transitions.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:38:03] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:38:03] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:38:03] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:38:03] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:38:04] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-12 16:38:04] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/167 places, 161/163 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 152 transition count 161
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM319-PT-none-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-12 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 163/163 transitions.
Ensure Unique test removed 10 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 156 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 154 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 154 transition count 161
Applied a total of 15 rules in 16 ms. Remains 154 /167 variables (removed 13) and now considering 161/163 (removed 2) transitions.
// Phase 1: matrix 161 rows 154 cols
[2021-05-12 16:38:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:38:04] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 161 rows 154 cols
[2021-05-12 16:38:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:38:04] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 154 cols
[2021-05-12 16:38:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:38:04] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/167 places, 161/163 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (NEQ s9 1) (NEQ s149 1)), p1:(OR (NEQ s84 1) (NEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 154 transition count 161
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM319-PT-none-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-14 finished in 681 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620837486656

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r121-tall-162075406800325"
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 ;