About the Execution of LTSMin+red for BugTracking-PT-q3m256
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2038.647 | 3600000.00 | 14314346.00 | 146.10 | T?FFTFTFF??FFF?T | 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-167813694600378.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-q3m256, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q3m256-CTLFireability-00
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-01
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-02
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-03
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-04
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-05
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-06
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-07
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-08
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-09
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-10
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-11
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-12
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-13
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-14
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678632047864
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:40:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:40:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:40:50] [INFO ] Load time of PNML (sax parser for PT used): 719 ms
[2023-03-12 14:40:50] [INFO ] Transformed 754 places.
[2023-03-12 14:40:50] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:40:50] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 943 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Deduced a syphon composed of 514 places in 146 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m256-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 76 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 14:40:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:40:51] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-12 14:40:51] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-12 14:40:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:40:51] [INFO ] Invariant cache hit.
[2023-03-12 14:40:52] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:40:54] [INFO ] Implicit Places using invariants and state equation in 2594 ms returned []
Implicit Place search using SMT with State Equation took 3123 ms to find 0 implicit places.
[2023-03-12 14:40:54] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:40:54] [INFO ] Invariant cache hit.
[2023-03-12 14:40:55] [INFO ] Dead Transitions using invariants and state equation in 885 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 4087 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 19 out of 237 places after structural reductions.
[2023-03-12 14:40:55] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2023-03-12 14:40:55] [INFO ] Flatten gal took : 252 ms
FORMULA BugTracking-PT-q3m256-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 14:40:55] [INFO ] Flatten gal took : 164 ms
[2023-03-12 14:40:56] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 12 out of 237 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 133429 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133429 steps, saw 64393 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:40:59] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:40:59] [INFO ] Invariant cache hit.
[2023-03-12 14:40:59] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:41:00] [INFO ] After 849ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 14:41:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:41:03] [INFO ] After 3014ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 14:41:03] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:41:04] [INFO ] After 696ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-12 14:41:05] [INFO ] Deduced a trap composed of 9 places in 370 ms of which 6 ms to minimize.
[2023-03-12 14:41:05] [INFO ] Deduced a trap composed of 21 places in 533 ms of which 1 ms to minimize.
[2023-03-12 14:41:06] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 0 ms to minimize.
[2023-03-12 14:41:06] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 1 ms to minimize.
[2023-03-12 14:41:06] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-12 14:41:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1967 ms
[2023-03-12 14:41:07] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 0 ms to minimize.
[2023-03-12 14:41:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 370 ms
[2023-03-12 14:41:07] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-12 14:41:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-12 14:41:07] [INFO ] After 3620ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-12 14:41:07] [INFO ] After 7105ms 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 106 ms.
Support contains 5 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 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 205 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 206 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10220 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) 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 147646 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147646 steps, saw 96989 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:41:11] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-12 14:41:11] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 14:41:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:41:11] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:41:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:41:12] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:41:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:41:12] [INFO ] After 319ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:41:13] [INFO ] Deduced a trap composed of 17 places in 353 ms of which 1 ms to minimize.
[2023-03-12 14:41:13] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 0 ms to minimize.
[2023-03-12 14:41:14] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 1 ms to minimize.
[2023-03-12 14:41:14] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-12 14:41:14] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 0 ms to minimize.
[2023-03-12 14:41:15] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-12 14:41:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2147 ms
[2023-03-12 14:41:15] [INFO ] After 2748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-12 14:41:15] [INFO ] After 3603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 134 ms.
Support contains 5 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 47 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 47 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 45 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-12 14:41:15] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-12 14:41:15] [INFO ] Invariant cache hit.
[2023-03-12 14:41:16] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 14:41:16] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-12 14:41:16] [INFO ] Invariant cache hit.
[2023-03-12 14:41:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:41:17] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
[2023-03-12 14:41:18] [INFO ] Redundant transitions in 210 ms returned []
[2023-03-12 14:41:18] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-12 14:41:18] [INFO ] Invariant cache hit.
[2023-03-12 14:41:19] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3454 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 237 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2611 rows 224 cols
[2023-03-12 14:41:19] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-12 14:41:19] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:41:20] [INFO ] After 632ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 14:41:20] [INFO ] After 814ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:41:20] [INFO ] After 936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:41:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:41:21] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:41:21] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-12 14:41:21] [INFO ] After 918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m256-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 14:41:21] [INFO ] Flatten gal took : 106 ms
[2023-03-12 14:41:21] [INFO ] Flatten gal took : 115 ms
[2023-03-12 14:41:21] [INFO ] Input system was already deterministic with 2750 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-12 14:41:22] [INFO ] Flatten gal took : 91 ms
[2023-03-12 14:41:22] [INFO ] Flatten gal took : 94 ms
[2023-03-12 14:41:22] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-12 14:41:22] [INFO ] Flatten gal took : 85 ms
[2023-03-12 14:41:22] [INFO ] Flatten gal took : 90 ms
[2023-03-12 14:41:22] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 9 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-12 14:41:22] [INFO ] Flatten gal took : 80 ms
[2023-03-12 14:41:22] [INFO ] Flatten gal took : 93 ms
[2023-03-12 14:41:23] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-12 14:41:23] [INFO ] Flatten gal took : 88 ms
[2023-03-12 14:41:23] [INFO ] Flatten gal took : 95 ms
[2023-03-12 14:41:23] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-12 14:41:23] [INFO ] Flatten gal took : 85 ms
[2023-03-12 14:41:23] [INFO ] Flatten gal took : 85 ms
[2023-03-12 14:41:23] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 14:41:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 18 ms.
Total runtime 33896 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/563/ctl_0_ --ctl=/tmp/563/ctl_1_ --ctl=/tmp/563/ctl_2_ --ctl=/tmp/563/ctl_3_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14091292 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16082908 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
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-q3m256"
export BK_EXAMINATION="CTLFireability"
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-q3m256, examination is CTLFireability"
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-167813694600378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;