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

About the Execution of LTSMin+red for Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
309.792 15011.00 38207.00 521.40 FFTFFTFFFFTFTTFF 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-167863540200554.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-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 22:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 21:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 21:59 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 3.9K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 22:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-2-CTLFireability-00
FORMULA_NAME Peterson-COL-2-CTLFireability-01
FORMULA_NAME Peterson-COL-2-CTLFireability-02
FORMULA_NAME Peterson-COL-2-CTLFireability-03
FORMULA_NAME Peterson-COL-2-CTLFireability-04
FORMULA_NAME Peterson-COL-2-CTLFireability-05
FORMULA_NAME Peterson-COL-2-CTLFireability-06
FORMULA_NAME Peterson-COL-2-CTLFireability-07
FORMULA_NAME Peterson-COL-2-CTLFireability-08
FORMULA_NAME Peterson-COL-2-CTLFireability-09
FORMULA_NAME Peterson-COL-2-CTLFireability-10
FORMULA_NAME Peterson-COL-2-CTLFireability-11
FORMULA_NAME Peterson-COL-2-CTLFireability-12
FORMULA_NAME Peterson-COL-2-CTLFireability-13
FORMULA_NAME Peterson-COL-2-CTLFireability-14
FORMULA_NAME Peterson-COL-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679095140769

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-COL-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 23:19:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 23:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 23:19:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 23:19:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 23:19:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 818 ms
[2023-03-17 23:19:04] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2023-03-17 23:19:04] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2023-03-17 23:19:04] [INFO ] Skeletonized 8 HLPN properties in 2 ms. Removed 8 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 6090 steps, including 1 resets, run visited all 9 properties in 90 ms. (steps per millisecond=67 )
[2023-03-17 23:19:04] [INFO ] Flatten gal took : 20 ms
[2023-03-17 23:19:04] [INFO ] Flatten gal took : 3 ms
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2023-03-17 23:19:04] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 22 ms.
[2023-03-17 23:19:04] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
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 10 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:19:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 23:19:04] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-17 23:19:04] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-17 23:19:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:19:04] [INFO ] Invariant cache hit.
[2023-03-17 23:19:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 23:19:04] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-17 23:19:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:19:05] [INFO ] Invariant cache hit.
[2023-03-17 23:19:05] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 102 out of 102 places after structural reductions.
[2023-03-17 23:19:05] [INFO ] Flatten gal took : 29 ms
[2023-03-17 23:19:05] [INFO ] Flatten gal took : 36 ms
[2023-03-17 23:19:05] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 42) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) 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 8) 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 8) 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 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 23:19:07] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:19:07] [INFO ] Invariant cache hit.
[2023-03-17 23:19:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 23:19:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 23:19:07] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-17 23:19:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 23:19:07] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-17 23:19:07] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-17 23:19:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 23:19:07] [INFO ] After 95ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-17 23:19:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 6 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 295 ms
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 266 ms
[2023-03-17 23:19:08] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-17 23:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-17 23:19:08] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-17 23:19:08] [INFO ] After 1193ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 33 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 64 place count 70 transition count 80
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 56 transition count 80
Applied a total of 92 rules in 21 ms. Remains 56 /102 variables (removed 46) and now considering 80/126 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 56/102 places, 80/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) 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 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:19:09] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 56 cols
[2023-03-17 23:19:09] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 23:19:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 23:19:09] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 23:19:09] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:19:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-17 23:19:09] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 23:19:09] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 23:19:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 23:19:09] [INFO ] After 30ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 230 ms
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-17 23:19:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-17 23:19:09] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-17 23:19:09] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 27 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 56/56 places, 80/80 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4997 steps, run visited all 3 properties in 53 ms. (steps per millisecond=94 )
Probabilistic random walk after 4997 steps, saw 1329 distinct states, run finished after 54 ms. (steps per millisecond=92 ) properties seen :3
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-COL-2-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 14 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 17 ms
[2023-03-17 23:19:10] [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-17 23:19:10] [INFO ] Flatten gal took : 9 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 9 ms
[2023-03-17 23:19:10] [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 3 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 8 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 9 ms
[2023-03-17 23:19:10] [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 12 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 12 ms. Remains : 42/102 places, 66/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [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 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-17 23:19:10] [INFO ] Flatten gal took : 7 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 8 ms
[2023-03-17 23:19:10] [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-17 23:19:10] [INFO ] Flatten gal took : 7 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 7 ms
[2023-03-17 23:19:10] [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 4 ms. Remains : 102/102 places, 126/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 7 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 7 ms
[2023-03-17 23:19:10] [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-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 8 ms
[2023-03-17 23:19:10] [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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 123
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 99 transition count 119
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 95 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 95 transition count 117
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 93 transition count 117
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 3 with 4 rules applied. Total rules applied 22 place count 91 transition count 115
Applied a total of 22 rules in 19 ms. Remains 91 /102 variables (removed 11) and now considering 115/126 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 91/102 places, 115/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
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 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 20 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 25 ms. Remains : 48/102 places, 72/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [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 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-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 48 place count 78 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 78 place count 63 transition count 87
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 90 place count 57 transition count 81
Applied a total of 90 rules in 10 ms. Remains 57 /102 variables (removed 45) and now considering 81/126 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 57/102 places, 81/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [INFO ] Input system was already deterministic with 81 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-17 23:19:10] [INFO ] Flatten gal took : 5 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 48 place count 78 transition count 84
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 84 place count 60 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 10 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 54/102 places, 78/126 transitions.
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 23:19:10] [INFO ] Input system was already deterministic with 78 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-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [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-17 23:19:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 23:19:10] [INFO ] Flatten gal took : 5 ms
[2023-03-17 23:19:11] [INFO ] Input system was already deterministic with 126 transitions.
[2023-03-17 23:19:11] [INFO ] Flatten gal took : 10 ms
[2023-03-17 23:19:11] [INFO ] Flatten gal took : 10 ms
[2023-03-17 23:19:11] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 14 ms.
[2023-03-17 23:19:11] [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 7928 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/540/ctl_0_ --ctl=/tmp/540/ctl_1_ --ctl=/tmp/540/ctl_2_ --ctl=/tmp/540/ctl_3_ --ctl=/tmp/540/ctl_4_ --ctl=/tmp/540/ctl_5_ --ctl=/tmp/540/ctl_6_ --ctl=/tmp/540/ctl_7_ --ctl=/tmp/540/ctl_8_ --ctl=/tmp/540/ctl_9_ --ctl=/tmp/540/ctl_10_ --ctl=/tmp/540/ctl_11_ --ctl=/tmp/540/ctl_12_ --ctl=/tmp/540/ctl_13_ --ctl=/tmp/540/ctl_14_ --mu-par --mu-opt
FORMULA Peterson-COL-2-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-2-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679095155780

--------------------
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-COL-2-CTLFireability-00
ctl formula formula --ctl=/tmp/540/ctl_0_
ctl formula name Peterson-COL-2-CTLFireability-01
ctl formula formula --ctl=/tmp/540/ctl_1_
ctl formula name Peterson-COL-2-CTLFireability-02
ctl formula formula --ctl=/tmp/540/ctl_2_
ctl formula name Peterson-COL-2-CTLFireability-04
ctl formula formula --ctl=/tmp/540/ctl_3_
ctl formula name Peterson-COL-2-CTLFireability-05
ctl formula formula --ctl=/tmp/540/ctl_4_
ctl formula name Peterson-COL-2-CTLFireability-06
ctl formula formula --ctl=/tmp/540/ctl_5_
ctl formula name Peterson-COL-2-CTLFireability-07
ctl formula formula --ctl=/tmp/540/ctl_6_
ctl formula name Peterson-COL-2-CTLFireability-08
ctl formula formula --ctl=/tmp/540/ctl_7_
ctl formula name Peterson-COL-2-CTLFireability-09
ctl formula formula --ctl=/tmp/540/ctl_8_
ctl formula name Peterson-COL-2-CTLFireability-10
ctl formula formula --ctl=/tmp/540/ctl_9_
ctl formula name Peterson-COL-2-CTLFireability-11
ctl formula formula --ctl=/tmp/540/ctl_10_
ctl formula name Peterson-COL-2-CTLFireability-12
ctl formula formula --ctl=/tmp/540/ctl_11_
ctl formula name Peterson-COL-2-CTLFireability-13
ctl formula formula --ctl=/tmp/540/ctl_12_
ctl formula name Peterson-COL-2-CTLFireability-14
ctl formula formula --ctl=/tmp/540/ctl_13_
ctl formula name Peterson-COL-2-CTLFireability-15
ctl formula formula --ctl=/tmp/540/ctl_14_
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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 8928 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.080 real 0.290 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, 2141 nodes
pnml2lts-sym: Formula /tmp/540/ctl_14_ 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/540/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_1_ 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/540/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/540/ctl_6_ does not hold for the initial state
pnml2lts-sym: group_next: 794 nodes total
pnml2lts-sym: group_explored: 788 nodes, 558 short vectors total
pnml2lts-sym: max token count: 1
free(): invalid pointer

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-COL-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-COL-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-167863540200554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-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 '' 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 ;