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-171620414700263.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-q8m032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700263
=====================================================================

--------------------
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 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 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-q8m032-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716647622459

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-q8m032
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 14:33:45] [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 14:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:33:46] [INFO ] Load time of PNML (sax parser for PT used): 1163 ms
[2024-05-25 14:33:46] [INFO ] Transformed 754 places.
[2024-05-25 14:33:46] [INFO ] Transformed 27370 transitions.
[2024-05-25 14:33:46] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1519 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 474 places in 109 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m032-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 141 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-25 14:33:47] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 14:33:47] [INFO ] Computed 8 invariants in 85 ms
[2024-05-25 14:33:48] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-25 14:33:48] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:33:48] [INFO ] Invariant cache hit.
[2024-05-25 14:33:49] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 14:33:50] [INFO ] Implicit Places using invariants and state equation in 2459 ms returned []
Implicit Place search using SMT with State Equation took 3400 ms to find 0 implicit places.
[2024-05-25 14:33:50] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:33:50] [INFO ] Invariant cache hit.
[2024-05-25 14:33:51] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4783 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 14 out of 277 places after structural reductions.
[2024-05-25 14:33:52] [INFO ] Flatten gal took : 525 ms
[2024-05-25 14:33:53] [INFO ] Flatten gal took : 335 ms
[2024-05-25 14:33:53] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10003 steps, including 16 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-25 14:33:54] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:33:54] [INFO ] Invariant cache hit.
[2024-05-25 14:33:55] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-25 14:33:56] [INFO ] After 1202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2024-05-25 14:33:56] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 14:33:56] [INFO ] After 377ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 14:33:56] [INFO ] After 1926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 14:33:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:33:57] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 14:33:59] [INFO ] After 1106ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 14:33:59] [INFO ] Deduced a trap composed of 91 places in 627 ms of which 5 ms to minimize.
[2024-05-25 14:34:00] [INFO ] Deduced a trap composed of 12 places in 631 ms of which 1 ms to minimize.
[2024-05-25 14:34:00] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 1 ms to minimize.
[2024-05-25 14:34:01] [INFO ] Deduced a trap composed of 20 places in 928 ms of which 14 ms to minimize.
[2024-05-25 14:34:02] [INFO ] Deduced a trap composed of 9 places in 500 ms of which 0 ms to minimize.
[2024-05-25 14:34:02] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 1 ms to minimize.
[2024-05-25 14:34:03] [INFO ] Deduced a trap composed of 56 places in 325 ms of which 0 ms to minimize.
[2024-05-25 14:34:03] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 1 ms to minimize.
[2024-05-25 14:34:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4753 ms
[2024-05-25 14:34:04] [INFO ] Deduced a trap composed of 110 places in 300 ms of which 1 ms to minimize.
[2024-05-25 14:34:04] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 0 ms to minimize.
[2024-05-25 14:34:04] [INFO ] Deduced a trap composed of 80 places in 289 ms of which 0 ms to minimize.
[2024-05-25 14:34:05] [INFO ] Deduced a trap composed of 60 places in 293 ms of which 1 ms to minimize.
[2024-05-25 14:34:05] [INFO ] Deduced a trap composed of 24 places in 337 ms of which 1 ms to minimize.
[2024-05-25 14:34:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1839 ms
[2024-05-25 14:34:06] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 0 ms to minimize.
[2024-05-25 14:34:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 277 ms
[2024-05-25 14:34:06] [INFO ] After 8417ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-25 14:34:06] [INFO ] After 9799ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 324 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 109665 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109665 steps, saw 36020 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 14:34:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:34:10] [INFO ] Computed 8 invariants in 39 ms
[2024-05-25 14:34:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:34:11] [INFO ] After 909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 14:34:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:34:11] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 14:34:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:34:12] [INFO ] After 927ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 14:34:12] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 0 ms to minimize.
[2024-05-25 14:34:13] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2024-05-25 14:34:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 652 ms
[2024-05-25 14:34:13] [INFO ] After 1693ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-25 14:34:13] [INFO ] After 2478ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 105 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 139362 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139362 steps, saw 55822 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:34:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:34:16] [INFO ] Invariant cache hit.
[2024-05-25 14:34:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:34:17] [INFO ] After 833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:34:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 14:34:18] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:34:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:34:18] [INFO ] After 289ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:34:19] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 1 ms to minimize.
[2024-05-25 14:34:19] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 1 ms to minimize.
[2024-05-25 14:34:20] [INFO ] Deduced a trap composed of 56 places in 381 ms of which 0 ms to minimize.
[2024-05-25 14:34:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1403 ms
[2024-05-25 14:34:20] [INFO ] After 1755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-25 14:34:20] [INFO ] After 2636ms 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 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:34:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:34:20] [INFO ] Invariant cache hit.
[2024-05-25 14:34:21] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-25 14:34:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:34:21] [INFO ] Invariant cache hit.
[2024-05-25 14:34:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:34:23] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 3036 ms to find 0 implicit places.
[2024-05-25 14:34:23] [INFO ] Redundant transitions in 314 ms returned []
[2024-05-25 14:34:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:34:23] [INFO ] Invariant cache hit.
[2024-05-25 14:34:24] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4531 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 312 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2024-05-25 14:34:25] [INFO ] Computed 9 invariants in 14 ms
[2024-05-25 14:34:25] [INFO ] [Real]Absence check using 9 positive place invariants in 70 ms returned sat
[2024-05-25 14:34:26] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:34:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-25 14:34:26] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:34:26] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-25 14:34:26] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
FORMULA BugTracking-PT-q8m032-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 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' '!(X(G(p0)))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 15 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:34:26] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-25 14:34:26] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 14:34:27] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-25 14:34:27] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:34:27] [INFO ] Invariant cache hit.
[2024-05-25 14:34:27] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-25 14:34:29] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2024-05-25 14:34:29] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-25 14:34:29] [INFO ] Invariant cache hit.
[2024-05-25 14:34:30] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3226 ms. Remains : 277/277 places, 3871/3871 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 163 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m032-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s18 1) (GEQ s114 1) (GEQ s230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BugTracking-PT-q8m032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m032-LTLFireability-15 finished in 3457 ms.
All properties solved by simple procedures.
Total runtime 45156 ms.

BK_STOP 1716647670494

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-q8m032"
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-q8m032, 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-171620414700263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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