Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414600203.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q3m002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414600203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q3m002-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716640072994

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 12:27:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 12:27:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:27:56] [INFO ] Load time of PNML (sax parser for PT used): 884 ms
[2024-05-25 12:27:56] [INFO ] Transformed 754 places.
[2024-05-25 12:27:56] [INFO ] Transformed 27370 transitions.
[2024-05-25 12:27:56] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 215 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 126 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-25 12:27:57] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 12:27:57] [INFO ] Computed 8 invariants in 62 ms
[2024-05-25 12:27:59] [INFO ] Implicit Places using invariants in 2049 ms returned []
[2024-05-25 12:27:59] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 12:27:59] [INFO ] Invariant cache hit.
[2024-05-25 12:28:01] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 12:28:02] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 4761 ms to find 0 implicit places.
[2024-05-25 12:28:02] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 12:28:02] [INFO ] Invariant cache hit.
[2024-05-25 12:28:03] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6157 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 3 out of 237 places after structural reductions.
[2024-05-25 12:28:05] [INFO ] Flatten gal took : 499 ms
[2024-05-25 12:28:05] [INFO ] Flatten gal took : 356 ms
[2024-05-25 12:28:06] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 141830 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141830 steps, saw 82552 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:28:10] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 12:28:10] [INFO ] Invariant cache hit.
[2024-05-25 12:28:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 12:28:10] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:28:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2024-05-25 12:28:11] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:11] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 12:28:11] [INFO ] After 89ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:11] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-25 12:28:11] [INFO ] After 943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 169 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213235 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213235 steps, saw 106763 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:28:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:28:14] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 12:28:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:28:15] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:28:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:28:16] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:28:16] [INFO ] After 171ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:16] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2024-05-25 12:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2024-05-25 12:28:16] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-25 12:28:16] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 68 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 73 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:28:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:28:16] [INFO ] Invariant cache hit.
[2024-05-25 12:28:18] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-05-25 12:28:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:28:18] [INFO ] Invariant cache hit.
[2024-05-25 12:28:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:28:19] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 3009 ms to find 0 implicit places.
[2024-05-25 12:28:20] [INFO ] Redundant transitions in 247 ms returned []
[2024-05-25 12:28:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:28:20] [INFO ] Invariant cache hit.
[2024-05-25 12:28:21] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4200 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 409 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 12:28:21] [INFO ] Computed 9 invariants in 14 ms
[2024-05-25 12:28:21] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 12:28:21] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:28:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 12:28:22] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 12:28:22] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-25 12:28:22] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&X(X(F(p0))))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 80 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-25 12:28:22] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 12:28:22] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 12:28:23] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-25 12:28:23] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 12:28:23] [INFO ] Invariant cache hit.
[2024-05-25 12:28:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:28:24] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2024-05-25 12:28:24] [INFO ] Redundant transitions in 133 ms returned []
[2024-05-25 12:28:24] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 12:28:24] [INFO ] Invariant cache hit.
[2024-05-25 12:28:25] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2793 ms. Remains : 235/237 places, 2753/2750 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 183 ms :[p0]
Running random walk in product with property : BugTracking-PT-q3m002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s66 1) (GEQ s144 1))], 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 2 ms.
FORMULA BugTracking-PT-q3m002-LTLFireability-06 TRUE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m002-LTLFireability-06 finished in 3047 ms.
All properties solved by simple procedures.
Total runtime 30131 ms.

BK_STOP 1716640106257

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BugTracking-PT-q3m002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BugTracking-PT-q3m002, 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 r065-tajo-171620414600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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