fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694500332
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BugTracking-PT-q3m004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
765.527 43283.00 77473.00 84.50 TTTTTFTFTFFFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 07:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 07:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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-q3m004-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678626543152

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:09:05] [INFO ] Load time of PNML (sax parser for PT used): 740 ms
[2023-03-12 13:09:05] [INFO ] Transformed 754 places.
[2023-03-12 13:09:05] [INFO ] Transformed 27370 transitions.
[2023-03-12 13:09:05] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 986 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 125 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 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 71 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 13:09:06] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 13:09:06] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-12 13:09:07] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-12 13:09:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:09:07] [INFO ] Invariant cache hit.
[2023-03-12 13:09:07] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:09:08] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2023-03-12 13:09:08] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:09:08] [INFO ] Invariant cache hit.
[2023-03-12 13:09:09] [INFO ] Dead Transitions using invariants and state equation in 1235 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 3305 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 6 out of 237 places after structural reductions.
[2023-03-12 13:09:10] [INFO ] Flatten gal took : 472 ms
[2023-03-12 13:09:10] [INFO ] Flatten gal took : 371 ms
[2023-03-12 13:09:11] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 130092 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130092 steps, saw 74584 distinct states, run finished after 3015 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:09:14] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:09:14] [INFO ] Invariant cache hit.
[2023-03-12 13:09:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:09:16] [INFO ] After 1019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:09:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:09:16] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:09:16] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:09:18] [INFO ] After 1451ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:09:18] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 7 ms to minimize.
[2023-03-12 13:09:19] [INFO ] Deduced a trap composed of 20 places in 523 ms of which 2 ms to minimize.
[2023-03-12 13:09:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1050 ms
[2023-03-12 13:09:19] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2023-03-12 13:09:20] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2023-03-12 13:09:20] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 1 ms to minimize.
[2023-03-12 13:09:20] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 1 ms to minimize.
[2023-03-12 13:09:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1331 ms
[2023-03-12 13:09:20] [INFO ] After 4003ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-12 13:09:21] [INFO ] After 5060ms 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 11 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 3 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 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 307 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10002 steps, including 201 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132249 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132249 steps, saw 86280 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:09:24] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-12 13:09:24] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-12 13:09:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:09:25] [INFO ] After 494ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 13:09:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:09:25] [INFO ] After 379ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:09:25] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:09:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:09:26] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:09:26] [INFO ] After 285ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:09:27] [INFO ] Deduced a trap composed of 10 places in 601 ms of which 2 ms to minimize.
[2023-03-12 13:09:27] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 1 ms to minimize.
[2023-03-12 13:09:28] [INFO ] Deduced a trap composed of 11 places in 502 ms of which 1 ms to minimize.
[2023-03-12 13:09:28] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 1 ms to minimize.
[2023-03-12 13:09:29] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 1 ms to minimize.
[2023-03-12 13:09:29] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 1 ms to minimize.
[2023-03-12 13:09:29] [INFO ] Deduced a trap composed of 49 places in 280 ms of which 1 ms to minimize.
[2023-03-12 13:09:30] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 0 ms to minimize.
[2023-03-12 13:09:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3697 ms
[2023-03-12 13:09:30] [INFO ] After 4090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-12 13:09:30] [INFO ] After 4795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 92 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 61 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 60 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-12 13:09:30] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-12 13:09:30] [INFO ] Invariant cache hit.
[2023-03-12 13:09:31] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-12 13:09:31] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-12 13:09:31] [INFO ] Invariant cache hit.
[2023-03-12 13:09:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:09:32] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2023-03-12 13:09:32] [INFO ] Redundant transitions in 222 ms returned []
[2023-03-12 13:09:32] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-12 13:09:32] [INFO ] Invariant cache hit.
[2023-03-12 13:09:34] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4323 ms. Remains : 230/230 places, 2748/2748 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 230 transition count 2618
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 228 transition count 2616
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 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 274 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2611 rows 224 cols
[2023-03-12 13:09:35] [INFO ] Computed 9 place invariants in 37 ms
[2023-03-12 13:09:35] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 13:09:36] [INFO ] After 605ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 13:09:36] [INFO ] After 722ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:09:36] [INFO ] After 828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:09:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 13:09:36] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:09:36] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-12 13:09:36] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m004-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(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 158 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 13:09:37] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 13:09:37] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 13:09:38] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-12 13:09:38] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:09:38] [INFO ] Invariant cache hit.
[2023-03-12 13:09:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:09:44] [INFO ] Implicit Places using invariants and state equation in 6036 ms returned []
Implicit Place search using SMT with State Equation took 7160 ms to find 0 implicit places.
[2023-03-12 13:09:44] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-12 13:09:44] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:09:44] [INFO ] Invariant cache hit.
[2023-03-12 13:09:45] [INFO ] Dead Transitions using invariants and state equation in 1330 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 8815 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m004-LTLFireability-07 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:(AND (GEQ s2 1) (GEQ s35 1) (GEQ s168 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 46 steps with 0 reset in 10 ms.
FORMULA BugTracking-PT-q3m004-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m004-LTLFireability-07 finished in 9165 ms.
All properties solved by simple procedures.
Total runtime 41448 ms.
ITS solved all properties within timeout

BK_STOP 1678626586435

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-q3m004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m004, 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 r041-tajo-167813694500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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