About the Execution of LTSMin+red for BugTracking-PT-q8m064
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
947.355 | 32554.00 | 56478.00 | 105.60 | TFTFFTFFTTTTFFFF | 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-167813694700428.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-q8m064, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700428
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 07:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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-q8m064-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678636351832
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-q8m064
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:52:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:52:34] [INFO ] Load time of PNML (sax parser for PT used): 701 ms
[2023-03-12 15:52:34] [INFO ] Transformed 754 places.
[2023-03-12 15:52:34] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:52:34] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 907 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 474 places in 116 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m064-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 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 94 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 15:52:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:52:35] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-12 15:52:35] [INFO ] Implicit Places using invariants in 671 ms returned []
[2023-03-12 15:52:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:52:35] [INFO ] Invariant cache hit.
[2023-03-12 15:52:36] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:52:37] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2741 ms to find 0 implicit places.
[2023-03-12 15:52:37] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:52:37] [INFO ] Invariant cache hit.
[2023-03-12 15:52:39] [INFO ] Dead Transitions using invariants and state equation in 1207 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 4047 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 5 out of 277 places after structural reductions.
[2023-03-12 15:52:39] [INFO ] Flatten gal took : 302 ms
[2023-03-12 15:52:39] [INFO ] Flatten gal took : 221 ms
[2023-03-12 15:52:40] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 126517 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126517 steps, saw 63275 distinct states, run finished after 3007 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:52:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:52:43] [INFO ] Invariant cache hit.
[2023-03-12 15:52:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:52:44] [INFO ] After 690ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 15:52:44] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:52:44] [INFO ] After 311ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:52:44] [INFO ] After 1107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:52:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:52:45] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:52:46] [INFO ] After 609ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:52:46] [INFO ] Deduced a trap composed of 58 places in 538 ms of which 6 ms to minimize.
[2023-03-12 15:52:47] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2023-03-12 15:52:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 941 ms
[2023-03-12 15:52:48] [INFO ] Deduced a trap composed of 24 places in 503 ms of which 2 ms to minimize.
[2023-03-12 15:52:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 609 ms
[2023-03-12 15:52:48] [INFO ] After 2275ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 15:52:48] [INFO ] After 3459ms 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 21 ms.
Support contains 3 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 6 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 372 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 373 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122972 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122972 steps, saw 46972 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:52:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:52:51] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-12 15:52:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:52:52] [INFO ] After 746ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:52:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:52:52] [INFO ] After 175ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:52:52] [INFO ] After 1008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:52:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:52:53] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:52:53] [INFO ] After 438ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:52:54] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-12 15:52:54] [INFO ] After 1458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 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 116 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 116 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 82 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:52:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:52:54] [INFO ] Invariant cache hit.
[2023-03-12 15:52:54] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-12 15:52:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:52:54] [INFO ] Invariant cache hit.
[2023-03-12 15:52:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:52:56] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2023-03-12 15:52:57] [INFO ] Redundant transitions in 321 ms returned []
[2023-03-12 15:52:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:52:57] [INFO ] Invariant cache hit.
[2023-03-12 15:52:58] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4150 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 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 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 382 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
[2023-03-12 15:52:58] [INFO ] Computed 9 place invariants in 48 ms
[2023-03-12 15:52:58] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 15:52:59] [INFO ] After 765ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:52:59] [INFO ] After 926ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-12 15:53:00] [INFO ] After 1128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q8m064-LTLFireability-12 FALSE 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.202303021504/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 17 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:53:00] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:53:00] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:53:00] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-12 15:53:00] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:53:00] [INFO ] Invariant cache hit.
[2023-03-12 15:53:01] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:53:02] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2023-03-12 15:53:02] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:53:02] [INFO ] Invariant cache hit.
[2023-03-12 15:53:03] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3785 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m064-LTLFireability-07 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 s10 1) (GEQ s94 1) (GEQ s218 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 3 ms.
FORMULA BugTracking-PT-q8m064-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m064-LTLFireability-07 finished in 4126 ms.
All properties solved by simple procedures.
Total runtime 30509 ms.
ITS solved all properties within timeout
BK_STOP 1678636384386
--------------------
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-q8m064"
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-q8m064, 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-167813694700428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m064.tgz
mv BugTracking-PT-q8m064 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 '
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 ;