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.r521-tall-167987246600362.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 Murphy-PT-D4N025, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 19K Mar 31 16:48 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 Murphy-PT-D4N025-CTLFireability-00
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-01
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-02
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-03
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-04
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-05
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-06
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-07
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-08
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-09
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-10
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-11
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-12
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-13
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-14
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680909624518

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=Murphy-PT-D4N025
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 23:20:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 23:20:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 23:20:28] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-04-07 23:20:28] [INFO ] Transformed 30 places.
[2023-04-07 23:20:28] [INFO ] Transformed 35 transitions.
[2023-04-07 23:20:28] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 23:20:28] [INFO ] Computed 6 invariants in 9 ms
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:28] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 31 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 19 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 44) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:20:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 23:20:29] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-04-07 23:20:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-07 23:20:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:29] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-04-07 23:20:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:30] [INFO ] After 32ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-04-07 23:20:30] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 23:20:30] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 17 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:30] [INFO ] Invariant cache hit.
[2023-04-07 23:20:30] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 318913 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318913 steps, saw 220788 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 23:20:33] [INFO ] Invariant cache hit.
[2023-04-07 23:20:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:20:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:33] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 23:20:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:20:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:33] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 23:20:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:33] [INFO ] After 20ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:20:33] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-07 23:20:33] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 17 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:33] [INFO ] Invariant cache hit.
[2023-04-07 23:20:34] [INFO ] Implicit Places using invariants in 545 ms returned [10, 11, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 556 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 559 ms. Remains : 27/30 places, 35/35 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 325635 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325635 steps, saw 225873 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 35 rows 27 cols
[2023-04-07 23:20:38] [INFO ] Computed 3 invariants in 1 ms
[2023-04-07 23:20:38] [INFO ] [Real]Absence check using 2 positive place invariants in 29 ms returned sat
[2023-04-07 23:20:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 9 ms returned sat
[2023-04-07 23:20:38] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 23:20:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:20:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:38] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 23:20:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:38] [INFO ] After 40ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:20:38] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 23:20:38] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 17 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 27/27 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:38] [INFO ] Invariant cache hit.
[2023-04-07 23:20:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-04-07 23:20:38] [INFO ] Invariant cache hit.
[2023-04-07 23:20:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:39] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-04-07 23:20:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 23:20:39] [INFO ] Invariant cache hit.
[2023-04-07 23:20:39] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 23:20:39] [INFO ] Invariant cache hit.
[2023-04-07 23:20:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:20:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 21 ms returned sat
[2023-04-07 23:20:39] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 23:20:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:20:39] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:39] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 23:20:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:39] [INFO ] After 30ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 23:20:39] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 23:20:39] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-04-07 23:20:39] [INFO ] Flatten gal took : 4 ms
[2023-04-07 23:20:39] [INFO ] Flatten gal took : 4 ms
[2023-04-07 23:20:39] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 23:20:39] [INFO ] Computed 6 invariants in 3 ms
[2023-04-07 23:20:40] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 736 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 5 ms
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:40] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:40] [INFO ] Invariant cache hit.
[2023-04-07 23:20:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 4 ms
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:40] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:40] [INFO ] Invariant cache hit.
[2023-04-07 23:20:40] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 4 ms
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 22 ms
[2023-04-07 23:20:40] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:40] [INFO ] Invariant cache hit.
[2023-04-07 23:20:40] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 146 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:40] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 15 ms
[2023-04-07 23:20:41] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:41] [INFO ] Invariant cache hit.
[2023-04-07 23:20:41] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 189 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:41] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:41] [INFO ] Invariant cache hit.
[2023-04-07 23:20:41] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:41] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:41] [INFO ] Invariant cache hit.
[2023-04-07 23:20:41] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 29 ms
[2023-04-07 23:20:41] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:41] [INFO ] Invariant cache hit.
[2023-04-07 23:20:41] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:41] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:41] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1602383 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :{}
Probabilistic random walk after 1602383 steps, saw 1114306 distinct states, run finished after 3014 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 23:20:44] [INFO ] Invariant cache hit.
[2023-04-07 23:20:44] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2023-04-07 23:20:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 49 ms returned sat
[2023-04-07 23:20:45] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 23:20:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:20:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-04-07 23:20:45] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 23:20:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:45] [INFO ] After 4ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 23:20:45] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 23:20:45] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 3 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /30 variables (removed 27) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 23:20:45] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 23:20:45] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 3/30 places, 4/35 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties (out of 1) seen :0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 10 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 23:20:46] [INFO ] Computed 6 invariants in 3 ms
[2023-04-07 23:20:48] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1451 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:48] [INFO ] Invariant cache hit.
[2023-04-07 23:20:48] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:48] [INFO ] Invariant cache hit.
[2023-04-07 23:20:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:48] [INFO ] Invariant cache hit.
[2023-04-07 23:20:48] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 5 ms
[2023-04-07 23:20:48] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:48] [INFO ] Invariant cache hit.
[2023-04-07 23:20:48] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:48] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:48] [INFO ] Invariant cache hit.
[2023-04-07 23:20:48] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:48] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:48] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:48] [INFO ] Invariant cache hit.
[2023-04-07 23:20:49] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:49] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:49] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:49] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:49] [INFO ] Invariant cache hit.
[2023-04-07 23:20:49] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:49] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:49] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:49] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 23:20:49] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:49] [INFO ] Flatten gal took : 17 ms
[2023-04-07 23:20:49] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2023-04-07 23:20:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 21364 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/602/ctl_0_ --ctl=/tmp/602/ctl_1_ --ctl=/tmp/602/ctl_2_ --ctl=/tmp/602/ctl_3_ --ctl=/tmp/602/ctl_4_ --ctl=/tmp/602/ctl_5_ --ctl=/tmp/602/ctl_6_ --ctl=/tmp/602/ctl_7_ --ctl=/tmp/602/ctl_8_ --ctl=/tmp/602/ctl_9_ --ctl=/tmp/602/ctl_10_ --ctl=/tmp/602/ctl_11_ --ctl=/tmp/602/ctl_12_ --ctl=/tmp/602/ctl_13_ --ctl=/tmp/602/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 225912 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105880 kB
FORMULA Murphy-PT-D4N025-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-PT-D4N025-CTLFireability-14
FORMULA Murphy-PT-D4N025-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680913222159

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name Murphy-PT-D4N025-CTLFireability-00
ctl formula formula --ctl=/tmp/602/ctl_0_
ctl formula name Murphy-PT-D4N025-CTLFireability-01
ctl formula formula --ctl=/tmp/602/ctl_1_
ctl formula name Murphy-PT-D4N025-CTLFireability-02
ctl formula formula --ctl=/tmp/602/ctl_2_
ctl formula name Murphy-PT-D4N025-CTLFireability-03
ctl formula formula --ctl=/tmp/602/ctl_3_
ctl formula name Murphy-PT-D4N025-CTLFireability-04
ctl formula formula --ctl=/tmp/602/ctl_4_
ctl formula name Murphy-PT-D4N025-CTLFireability-05
ctl formula formula --ctl=/tmp/602/ctl_5_
ctl formula name Murphy-PT-D4N025-CTLFireability-06
ctl formula formula --ctl=/tmp/602/ctl_6_
ctl formula name Murphy-PT-D4N025-CTLFireability-08
ctl formula formula --ctl=/tmp/602/ctl_7_
ctl formula name Murphy-PT-D4N025-CTLFireability-09
ctl formula formula --ctl=/tmp/602/ctl_8_
ctl formula name Murphy-PT-D4N025-CTLFireability-10
ctl formula formula --ctl=/tmp/602/ctl_9_
ctl formula name Murphy-PT-D4N025-CTLFireability-11
ctl formula formula --ctl=/tmp/602/ctl_10_
ctl formula name Murphy-PT-D4N025-CTLFireability-12
ctl formula formula --ctl=/tmp/602/ctl_11_
ctl formula name Murphy-PT-D4N025-CTLFireability-13
ctl formula formula --ctl=/tmp/602/ctl_12_
ctl formula name Murphy-PT-D4N025-CTLFireability-14
ctl formula formula --ctl=/tmp/602/ctl_13_
ctl formula name Murphy-PT-D4N025-CTLFireability-15
ctl formula formula --ctl=/tmp/602/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 30 places, 35 transitions and 135 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: 35->15 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 30; there are 15 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 416325 group checks and 0 next state calls
pnml2lts-sym: reachability took 2342.820 real 8443.330 user 874.330 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.150 real 0.630 user 0.010 sys
pnml2lts-sym: state space has 2.0012606308671e+16 states, 365218 nodes
pnml2lts-sym: Formula /tmp/602/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_10_ 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/602/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/602/ctl_6_ does not hold for the initial state
Killing (15) : 608
Killing (9) : 608

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="Murphy-PT-D4N025"
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 Murphy-PT-D4N025, 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 r521-tall-167987246600362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N025.tgz
mv Murphy-PT-D4N025 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 ;