Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820400084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 IBM5964-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 13K Apr 30 07:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 30 07:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 30 07:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 07:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 171K May 10 09:34 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 IBM5964-PT-none-LTLFireability-00
FORMULA_NAME IBM5964-PT-none-LTLFireability-01
FORMULA_NAME IBM5964-PT-none-LTLFireability-02
FORMULA_NAME IBM5964-PT-none-LTLFireability-03
FORMULA_NAME IBM5964-PT-none-LTLFireability-04
FORMULA_NAME IBM5964-PT-none-LTLFireability-05
FORMULA_NAME IBM5964-PT-none-LTLFireability-06
FORMULA_NAME IBM5964-PT-none-LTLFireability-07
FORMULA_NAME IBM5964-PT-none-LTLFireability-08
FORMULA_NAME IBM5964-PT-none-LTLFireability-09
FORMULA_NAME IBM5964-PT-none-LTLFireability-10
FORMULA_NAME IBM5964-PT-none-LTLFireability-11
FORMULA_NAME IBM5964-PT-none-LTLFireability-12
FORMULA_NAME IBM5964-PT-none-LTLFireability-13
FORMULA_NAME IBM5964-PT-none-LTLFireability-14
FORMULA_NAME IBM5964-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652745125789

Running Version 202205111006
[2022-05-16 23:52:06] [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]
[2022-05-16 23:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:52:07] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2022-05-16 23:52:07] [INFO ] Transformed 263 places.
[2022-05-16 23:52:07] [INFO ] Transformed 139 transitions.
[2022-05-16 23:52:07] [INFO ] Parsed PT model containing 263 places and 139 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBM5964-PT-none-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 95 places
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 159 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 156 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 156 transition count 136
Applied a total of 110 rules in 31 ms. Remains 156 /263 variables (removed 107) and now considering 136/139 (removed 3) transitions.
// Phase 1: matrix 136 rows 156 cols
[2022-05-16 23:52:07] [INFO ] Computed 27 place invariants in 14 ms
[2022-05-16 23:52:07] [INFO ] Implicit Places using invariants in 181 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/263 places, 136/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 135
Applied a total of 2 rules in 13 ms. Remains 154 /155 variables (removed 1) and now considering 135/136 (removed 1) transitions.
// Phase 1: matrix 135 rows 154 cols
[2022-05-16 23:52:07] [INFO ] Computed 26 place invariants in 4 ms
[2022-05-16 23:52:07] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 135 rows 154 cols
[2022-05-16 23:52:07] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 23:52:07] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/263 places, 135/139 transitions.
Finished structural reductions, in 2 iterations. Remains : 154/263 places, 135/139 transitions.
Support contains 51 out of 154 places after structural reductions.
[2022-05-16 23:52:07] [INFO ] Flatten gal took : 36 ms
[2022-05-16 23:52:07] [INFO ] Flatten gal took : 14 ms
[2022-05-16 23:52:07] [INFO ] Input system was already deterministic with 135 transitions.
Support contains 50 out of 154 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 213 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 135 rows 154 cols
[2022-05-16 23:52:08] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 23:52:08] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 3 ms returned sat
[2022-05-16 23:52:08] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-16 23:52:08] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 7 ms returned sat
[2022-05-16 23:52:08] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :18 sat :0
Fused 18 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
FORMULA IBM5964-PT-none-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 18 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM5964-PT-none-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 154 stabilizing places and 135 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 154 transition count 135
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA IBM5964-PT-none-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U true)))'
Support contains 0 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 135/135 transitions.
Graph (complete) has 194 edges and 154 vertex of which 0 are kept as prefixes of interest. Removing 154 places using SCC suffix rule.5 ms
Discarding 154 places :
Also discarding 135 output transitions
Drop transitions removed 135 transitions
Applied a total of 1 rules in 13 ms. Remains 0 /154 variables (removed 154) and now considering 0/135 (removed 135) transitions.
[2022-05-16 23:52:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants in 4 ms returned []
[2022-05-16 23:52:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2022-05-16 23:52:09] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 23:52:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 23:52:09] [INFO ] Dead Transitions using invariants and state equation in 6 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/154 places, 0/135 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/154 places, 0/135 transitions.
Stuttering acceptance computed with spot in 27 ms :[false]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA IBM5964-PT-none-LTLFireability-04 TRUE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-04 finished in 130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(F(X(p0)))))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 135/135 transitions.
Graph (complete) has 194 edges and 154 vertex of which 25 are kept as prefixes of interest. Removing 129 places using SCC suffix rule.2 ms
Discarding 129 places :
Also discarding 111 output transitions
Drop transitions removed 111 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 23 transition count 14
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 16 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 17 place count 16 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 12 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 11 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 11 transition count 9
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 2 with 2 rules applied. Total rules applied 29 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 7 transition count 6
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 6 transition count 6
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 5 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 5 transition count 4
Applied a total of 37 rules in 11 ms. Remains 5 /154 variables (removed 149) and now considering 4/135 (removed 131) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 23:52:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 23:52:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/154 places, 4/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4/154 places, 4/135 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 18 reset in 3 ms.
FORMULA IBM5964-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-10 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p0)&&(false U false)))||p0)))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 135/135 transitions.
Ensure Unique test removed 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 132 transition count 135
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 126 transition count 129
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 126 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 125 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 124 transition count 127
Applied a total of 38 rules in 21 ms. Remains 124 /154 variables (removed 30) and now considering 127/135 (removed 8) transitions.
// Phase 1: matrix 127 rows 124 cols
[2022-05-16 23:52:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants in 46 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/154 places, 127/135 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 126
Applied a total of 2 rules in 5 ms. Remains 122 /123 variables (removed 1) and now considering 126/127 (removed 1) transitions.
// Phase 1: matrix 126 rows 122 cols
[2022-05-16 23:52:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 126 rows 122 cols
[2022-05-16 23:52:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 122/154 places, 126/135 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/154 places, 126/135 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 122 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 126
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IBM5964-PT-none-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM5964-PT-none-LTLFireability-15 finished in 767 ms.
All properties solved by simple procedures.
Total runtime 3344 ms.

BK_STOP 1652745130618

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="IBM5964-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 IBM5964-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 r132-tall-165271820400084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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