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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15802.487 3600000.00 14296392.00 103.20 ?TTT?TT?F?T?FFTF 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-167813694700434.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-q8m128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Feb 26 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 07:28 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-q8m128-CTLFireability-00
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-01
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-02
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-03
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-04
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-05
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-06
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-07
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-08
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-09
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-10
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-11
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-12
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-13
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-14
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678636850172

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-q8m128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:00:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:00:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:00:52] [INFO ] Load time of PNML (sax parser for PT used): 751 ms
[2023-03-12 16:00:52] [INFO ] Transformed 754 places.
[2023-03-12 16:00:52] [INFO ] Transformed 27370 transitions.
[2023-03-12 16:00:52] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 949 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 474 places in 100 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m128-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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
Applied a total of 2 rules in 76 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2023-03-12 16:00:53] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2023-03-12 16:00:53] [INFO ] Computed 8 place invariants in 76 ms
[2023-03-12 16:00:53] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-03-12 16:00:53] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-12 16:00:53] [INFO ] Invariant cache hit.
[2023-03-12 16:00:54] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 16:00:54] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-03-12 16:00:54] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-12 16:00:54] [INFO ] Invariant cache hit.
[2023-03-12 16:00:56] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3904/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3613 ms. Remains : 278/280 places, 3904/3904 transitions.
Support contains 17 out of 278 places after structural reductions.
[2023-03-12 16:00:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 16:00:57] [INFO ] Flatten gal took : 593 ms
[2023-03-12 16:00:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m128-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:00:57] [INFO ] Flatten gal took : 304 ms
[2023-03-12 16:00:58] [INFO ] Input system was already deterministic with 3904 transitions.
Support contains 6 out of 278 places (down from 17) after GAL structural reductions.
FORMULA BugTracking-PT-q8m128-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 111866 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111866 steps, saw 53360 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:01:02] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-12 16:01:02] [INFO ] Invariant cache hit.
[2023-03-12 16:01:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:01:02] [INFO ] After 830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:01:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:01:03] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:01:03] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 16:01:04] [INFO ] After 457ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:01:05] [INFO ] Deduced a trap composed of 24 places in 602 ms of which 6 ms to minimize.
[2023-03-12 16:01:05] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-12 16:01:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 965 ms
[2023-03-12 16:01:05] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 1 ms to minimize.
[2023-03-12 16:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 539 ms
[2023-03-12 16:01:06] [INFO ] After 2113ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-12 16:01:06] [INFO ] After 3111ms 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 28 ms.
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
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 6 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 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 18 place count 269 transition count 3871
Applied a total of 18 rules in 426 ms. Remains 269 /278 variables (removed 9) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 269/278 places, 3871/3904 transitions.
Incomplete random walk after 10059 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78877 steps, run timeout after 3006 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78877 steps, saw 32907 distinct states, run finished after 3006 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:01:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:01:09] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-12 16:01:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:01:10] [INFO ] After 1102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:01:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:01:12] [INFO ] After 1253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:01:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:01:12] [INFO ] After 406ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:01:13] [INFO ] Deduced a trap composed of 18 places in 1074 ms of which 27 ms to minimize.
[2023-03-12 16:01:14] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 1 ms to minimize.
[2023-03-12 16:01:14] [INFO ] Deduced a trap composed of 26 places in 457 ms of which 1 ms to minimize.
[2023-03-12 16:01:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2246 ms
[2023-03-12 16:01:15] [INFO ] After 2792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 248 ms.
[2023-03-12 16:01:15] [INFO ] After 4419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 149 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 150 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 149 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:01:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:01:15] [INFO ] Invariant cache hit.
[2023-03-12 16:01:16] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-12 16:01:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:01:16] [INFO ] Invariant cache hit.
[2023-03-12 16:01:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:01:19] [INFO ] Implicit Places using invariants and state equation in 3807 ms returned []
Implicit Place search using SMT with State Equation took 4308 ms to find 0 implicit places.
[2023-03-12 16:01:20] [INFO ] Redundant transitions in 392 ms returned []
[2023-03-12 16:01:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:01:20] [INFO ] Invariant cache hit.
[2023-03-12 16:01:22] [INFO ] Dead Transitions using invariants and state equation in 2041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6922 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 491 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 16:01:22] [INFO ] Computed 9 place invariants in 36 ms
[2023-03-12 16:01:23] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 16:01:23] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:01:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 16:01:24] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:01:24] [INFO ] After 1022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 16:01:25] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2023-03-12 16:01:25] [INFO ] Flatten gal took : 163 ms
[2023-03-12 16:01:25] [INFO ] Flatten gal took : 206 ms
[2023-03-12 16:01:25] [INFO ] Input system was already deterministic with 3904 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 25 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-12 16:01:26] [INFO ] Flatten gal took : 194 ms
[2023-03-12 16:01:26] [INFO ] Flatten gal took : 159 ms
[2023-03-12 16:01:26] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 21 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-12 16:01:26] [INFO ] Flatten gal took : 180 ms
[2023-03-12 16:01:27] [INFO ] Flatten gal took : 150 ms
[2023-03-12 16:01:27] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 21 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-12 16:01:27] [INFO ] Flatten gal took : 123 ms
[2023-03-12 16:01:27] [INFO ] Flatten gal took : 144 ms
[2023-03-12 16:01:28] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 108 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-12 16:01:28] [INFO ] Flatten gal took : 126 ms
[2023-03-12 16:01:28] [INFO ] Flatten gal took : 137 ms
[2023-03-12 16:01:28] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 24 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-12 16:01:29] [INFO ] Flatten gal took : 129 ms
[2023-03-12 16:01:29] [INFO ] Flatten gal took : 145 ms
[2023-03-12 16:01:29] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-12 16:01:29] [INFO ] Flatten gal took : 129 ms
[2023-03-12 16:01:29] [INFO ] Flatten gal took : 131 ms
[2023-03-12 16:01:29] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 16:01:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 278 places, 3904 transitions and 19190 arcs took 25 ms.
Total runtime 38145 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/545/ctl_0_ --ctl=/tmp/545/ctl_1_ --ctl=/tmp/545/ctl_2_ --ctl=/tmp/545/ctl_3_ --ctl=/tmp/545/ctl_4_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 349104 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16080864 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-q8m128"
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-q8m128, 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-167813694700434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;