About the Execution of LTSMin+red for Peterson-PT-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
500.039 | 18090.00 | 46130.00 | 723.40 | FFTFFTFFTTFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540300602.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Peterson-PT-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300602
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:23 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 Peterson-PT-2-CTLFireability-00
FORMULA_NAME Peterson-PT-2-CTLFireability-01
FORMULA_NAME Peterson-PT-2-CTLFireability-02
FORMULA_NAME Peterson-PT-2-CTLFireability-03
FORMULA_NAME Peterson-PT-2-CTLFireability-04
FORMULA_NAME Peterson-PT-2-CTLFireability-05
FORMULA_NAME Peterson-PT-2-CTLFireability-06
FORMULA_NAME Peterson-PT-2-CTLFireability-07
FORMULA_NAME Peterson-PT-2-CTLFireability-08
FORMULA_NAME Peterson-PT-2-CTLFireability-09
FORMULA_NAME Peterson-PT-2-CTLFireability-10
FORMULA_NAME Peterson-PT-2-CTLFireability-11
FORMULA_NAME Peterson-PT-2-CTLFireability-12
FORMULA_NAME Peterson-PT-2-CTLFireability-13
FORMULA_NAME Peterson-PT-2-CTLFireability-14
FORMULA_NAME Peterson-PT-2-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679131738458
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=Peterson-PT-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:29:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 09:29:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:29:01] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-18 09:29:01] [INFO ] Transformed 102 places.
[2023-03-18 09:29:01] [INFO ] Transformed 126 transitions.
[2023-03-18 09:29:01] [INFO ] Found NUPN structural information;
[2023-03-18 09:29:01] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 16 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-18 09:29:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-18 09:29:01] [INFO ] Computed 11 place invariants in 15 ms
[2023-03-18 09:29:01] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-18 09:29:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-18 09:29:01] [INFO ] Invariant cache hit.
[2023-03-18 09:29:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 09:29:02] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-18 09:29:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-18 09:29:02] [INFO ] Invariant cache hit.
[2023-03-18 09:29:02] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 102 out of 102 places after structural reductions.
[2023-03-18 09:29:02] [INFO ] Flatten gal took : 48 ms
[2023-03-18 09:29:02] [INFO ] Flatten gal took : 27 ms
[2023-03-18 09:29:02] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=10 ) properties (out of 89) seen :67
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-18 09:29:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-18 09:29:03] [INFO ] Invariant cache hit.
[2023-03-18 09:29:04] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:29:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 09:29:04] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2023-03-18 09:29:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:29:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 09:29:04] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2023-03-18 09:29:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 09:29:04] [INFO ] After 153ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :15
[2023-03-18 09:29:04] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 7 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-18 09:29:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 187 ms
[2023-03-18 09:29:05] [INFO ] After 1229ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :13
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-18 09:29:06] [INFO ] After 1803ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :13
Fused 17 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 40 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 102 transition count 99
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 75 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 74 transition count 98
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 56 place count 74 transition count 86
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 80 place count 62 transition count 86
Applied a total of 80 rules in 37 ms. Remains 62 /102 variables (removed 40) and now considering 86/126 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 62/102 places, 86/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 09:29:07] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
// Phase 1: matrix 80 rows 62 cols
[2023-03-18 09:29:07] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-18 09:29:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 09:29:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 09:29:07] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 09:29:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-18 09:29:07] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 09:29:07] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 09:29:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 09:29:07] [INFO ] After 54ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 09:29:07] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-18 09:29:07] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-18 09:29:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-18 09:29:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2023-03-18 09:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-18 09:29:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2023-03-18 09:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-18 09:29:07] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2023-03-18 09:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-18 09:29:07] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-18 09:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-18 09:29:07] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-18 09:29:08] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 35 ms.
Support contains 33 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 86/86 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 60 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 58 transition count 82
Applied a total of 8 rules in 9 ms. Remains 58 /62 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 58/62 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Finished probabilistic random walk after 6800 steps, run visited all 7 properties in 91 ms. (steps per millisecond=74 )
Probabilistic random walk after 6800 steps, saw 1725 distinct states, run finished after 91 ms. (steps per millisecond=74 ) properties seen :7
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-PT-2-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 09:29:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 13 ms
FORMULA Peterson-PT-2-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 14 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 14 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 9 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 8 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 8 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 11 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 42/102 places, 66/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 5 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 5 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 8 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 8 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 102 transition count 99
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 75 transition count 96
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 60 place count 72 transition count 82
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 88 place count 58 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 55 transition count 79
Applied a total of 94 rules in 13 ms. Remains 55 /102 variables (removed 47) and now considering 79/126 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 55/102 places, 79/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 4 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 5 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 102 transition count 97
Reduce places removed 29 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 73 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 64 place count 70 transition count 77
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 98 place count 53 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 13 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 48/102 places, 72/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 3 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 4 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:29:09] [INFO ] Input system was already deterministic with 126 transitions.
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 9 ms
[2023-03-18 09:29:09] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:29:09] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2023-03-18 09:29:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 126 transitions and 384 arcs took 1 ms.
Total runtime 8588 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/538/ctl_0_ --ctl=/tmp/538/ctl_1_ --ctl=/tmp/538/ctl_2_ --ctl=/tmp/538/ctl_3_ --ctl=/tmp/538/ctl_4_ --ctl=/tmp/538/ctl_5_ --ctl=/tmp/538/ctl_6_ --ctl=/tmp/538/ctl_7_ --ctl=/tmp/538/ctl_8_ --ctl=/tmp/538/ctl_9_ --ctl=/tmp/538/ctl_10_ --ctl=/tmp/538/ctl_11_ --ctl=/tmp/538/ctl_12_ --ctl=/tmp/538/ctl_13_ --mu-par --mu-opt
FORMULA Peterson-PT-2-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1679131756548
--------------------
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
ctl formula name Peterson-PT-2-CTLFireability-00
ctl formula formula --ctl=/tmp/538/ctl_0_
ctl formula name Peterson-PT-2-CTLFireability-01
ctl formula formula --ctl=/tmp/538/ctl_1_
ctl formula name Peterson-PT-2-CTLFireability-02
ctl formula formula --ctl=/tmp/538/ctl_2_
ctl formula name Peterson-PT-2-CTLFireability-04
ctl formula formula --ctl=/tmp/538/ctl_3_
ctl formula name Peterson-PT-2-CTLFireability-05
ctl formula formula --ctl=/tmp/538/ctl_4_
ctl formula name Peterson-PT-2-CTLFireability-06
ctl formula formula --ctl=/tmp/538/ctl_5_
ctl formula name Peterson-PT-2-CTLFireability-07
ctl formula formula --ctl=/tmp/538/ctl_6_
ctl formula name Peterson-PT-2-CTLFireability-08
ctl formula formula --ctl=/tmp/538/ctl_7_
ctl formula name Peterson-PT-2-CTLFireability-09
ctl formula formula --ctl=/tmp/538/ctl_8_
ctl formula name Peterson-PT-2-CTLFireability-10
ctl formula formula --ctl=/tmp/538/ctl_9_
ctl formula name Peterson-PT-2-CTLFireability-11
ctl formula formula --ctl=/tmp/538/ctl_10_
ctl formula name Peterson-PT-2-CTLFireability-12
ctl formula formula --ctl=/tmp/538/ctl_11_
ctl formula name Peterson-PT-2-CTLFireability-13
ctl formula formula --ctl=/tmp/538/ctl_12_
ctl formula name Peterson-PT-2-CTLFireability-14
ctl formula formula --ctl=/tmp/538/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 102 places, 126 transitions and 384 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 126->120 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 102; there are 120 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 12219 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.120 real 0.410 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 20754 states, 3100 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/538/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/538/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_8_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/538/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/538/ctl_11_ holds for the initial state
pnml2lts-sym: group_next: 794 nodes total
pnml2lts-sym: group_explored: 790 nodes, 558 short vectors total
pnml2lts-sym: max token count: 1
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-sym(+0x9b684) [0x5567a571a684]
1: pnml2lts-sym(+0x9b726) [0x5567a571a726]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe7128d9140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x87870) [0x7fe712619870]
4: /lib/x86_64-linux-gnu/libpthread.so.0(+0x7ebf) [0x7fe7128cdebf]
5: /lib/x86_64-linux-gnu/libc.so.6(clone+0x3f) [0x7fe71268ea2f]
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="Peterson-PT-2"
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 Peterson-PT-2, 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 r265-smll-167863540300602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 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 ;