Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899700106.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CloudReconfiguration-PT-314, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899700106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 3.2K Mar 30 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K Mar 24 05:37 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 CloudReconfiguration-PT-314-00
FORMULA_NAME CloudReconfiguration-PT-314-01
FORMULA_NAME CloudReconfiguration-PT-314-02
FORMULA_NAME CloudReconfiguration-PT-314-03
FORMULA_NAME CloudReconfiguration-PT-314-04
FORMULA_NAME CloudReconfiguration-PT-314-05
FORMULA_NAME CloudReconfiguration-PT-314-06
FORMULA_NAME CloudReconfiguration-PT-314-07
FORMULA_NAME CloudReconfiguration-PT-314-08
FORMULA_NAME CloudReconfiguration-PT-314-09
FORMULA_NAME CloudReconfiguration-PT-314-10
FORMULA_NAME CloudReconfiguration-PT-314-11
FORMULA_NAME CloudReconfiguration-PT-314-12
FORMULA_NAME CloudReconfiguration-PT-314-13
FORMULA_NAME CloudReconfiguration-PT-314-14
FORMULA_NAME CloudReconfiguration-PT-314-15

=== Now, execution of the tool begins

BK_START 1591147122582

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 01:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:18:46] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2020-06-03 01:18:46] [INFO ] Transformed 2585 places.
[2020-06-03 01:18:46] [INFO ] Transformed 3095 transitions.
[2020-06-03 01:18:46] [INFO ] Found NUPN structural information;
[2020-06-03 01:18:46] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 183 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1054 resets, run finished after 743 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 3095 rows 2585 cols
[2020-06-03 01:18:47] [INFO ] Computed 4 place invariants in 187 ms
[2020-06-03 01:18:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 143 ms returned sat
[2020-06-03 01:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:19:07] [INFO ] [Real]Absence check using state equation in 18280 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 01:19:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 01:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:19:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:19:27] [INFO ] [Real]Absence check using state equation in 19332 ms returned unknown
[2020-06-03 01:19:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 142 ms returned sat
[2020-06-03 01:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:19:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:19:47] [INFO ] [Real]Absence check using state equation in 19364 ms returned (error "Failed to check-sat")
[2020-06-03 01:19:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 01:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:20:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:20:07] [INFO ] [Real]Absence check using state equation in 19379 ms returned unknown
[2020-06-03 01:20:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-06-03 01:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:20:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:20:27] [INFO ] [Real]Absence check using state equation in 18314 ms returned (error "Failed to check-sat")
[2020-06-03 01:20:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 01:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:20:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:20:47] [INFO ] [Real]Absence check using state equation in 19332 ms returned unknown
[2020-06-03 01:20:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 126 ms returned sat
[2020-06-03 01:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:21:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:21:07] [INFO ] [Real]Absence check using state equation in 19274 ms returned (error "Failed to check-sat")
[2020-06-03 01:21:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-06-03 01:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:21:28] [INFO ] [Real]Absence check using state equation in 19400 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 01:21:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 01:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:21:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:21:48] [INFO ] [Real]Absence check using state equation in 19399 ms returned (error "Failed to check-sat")
[2020-06-03 01:21:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 01:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:22:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:22:08] [INFO ] [Real]Absence check using state equation in 19369 ms returned (error "Failed to check-sat")
[2020-06-03 01:22:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-06-03 01:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:22:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:22:28] [INFO ] [Real]Absence check using state equation in 19358 ms returned (error "Failed to check-sat")
[2020-06-03 01:22:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 185 ms returned sat
[2020-06-03 01:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:22:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:22:48] [INFO ] [Real]Absence check using state equation in 19339 ms returned (error "Failed to check-sat")
[2020-06-03 01:22:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 148 ms returned sat
[2020-06-03 01:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:23:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:23:08] [INFO ] [Real]Absence check using state equation in 19367 ms returned (error "Failed to check-sat")
[2020-06-03 01:23:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 125 ms returned sat
[2020-06-03 01:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:23:13] [INFO ] [Real]Absence check using state equation in 4614 ms returned unsat
[2020-06-03 01:23:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-06-03 01:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:23:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:23:33] [INFO ] [Real]Absence check using state equation in 19399 ms returned (error "Failed to check-sat")
[2020-06-03 01:23:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-06-03 01:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:23:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:23:53] [INFO ] [Real]Absence check using state equation in 19391 ms returned (error "Failed to check-sat")
[2020-06-03 01:23:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 01:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:24:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:24:13] [INFO ] [Real]Absence check using state equation in 18749 ms returned (error "Failed to check-sat")
[2020-06-03 01:24:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 01:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:24:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:24:33] [INFO ] [Real]Absence check using state equation in 19408 ms returned (error "Failed to check-sat")
[2020-06-03 01:24:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned unsat
[2020-06-03 01:24:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 01:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:24:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:24:54] [INFO ] [Real]Absence check using state equation in 19453 ms returned (error "Failed to check-sat")
[2020-06-03 01:24:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-06-03 01:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:25:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:25:14] [INFO ] [Real]Absence check using state equation in 19416 ms returned unknown
[2020-06-03 01:25:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 129 ms returned sat
[2020-06-03 01:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:25:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:25:34] [INFO ] [Real]Absence check using state equation in 19398 ms returned unknown
[2020-06-03 01:25:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 129 ms returned sat
[2020-06-03 01:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:25:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:25:54] [INFO ] [Real]Absence check using state equation in 19388 ms returned (error "Failed to check-sat")
[2020-06-03 01:25:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 125 ms returned sat
[2020-06-03 01:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:26:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:26:14] [INFO ] [Real]Absence check using state equation in 19458 ms returned (error "Failed to check-sat")
[2020-06-03 01:26:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 124 ms returned sat
[2020-06-03 01:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:26:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:26:34] [INFO ] [Real]Absence check using state equation in 19421 ms returned (error "Failed to check-sat")
[2020-06-03 01:26:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 147 ms returned sat
[2020-06-03 01:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:26:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:26:54] [INFO ] [Real]Absence check using state equation in 17572 ms returned unknown
[2020-06-03 01:26:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 144 ms returned sat
[2020-06-03 01:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:27:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:27:14] [INFO ] [Real]Absence check using state equation in 19366 ms returned (error "Failed to check-sat")
[2020-06-03 01:27:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 01:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:27:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:27:34] [INFO ] [Real]Absence check using state equation in 19404 ms returned unknown
[2020-06-03 01:27:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 121 ms returned sat
[2020-06-03 01:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:27:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:27:54] [INFO ] [Real]Absence check using state equation in 19391 ms returned unknown
[2020-06-03 01:27:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-03 01:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:28:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:28:14] [INFO ] [Real]Absence check using state equation in 19415 ms returned (error "Failed to check-sat")
[2020-06-03 01:28:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 133 ms returned sat
[2020-06-03 01:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:28:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:28:34] [INFO ] [Real]Absence check using state equation in 19431 ms returned (error "Failed to check-sat")
[2020-06-03 01:28:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 01:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:28:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:28:54] [INFO ] [Real]Absence check using state equation in 19423 ms returned (error "Failed to check-sat")
[2020-06-03 01:28:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 01:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:29:14] [INFO ] [Real]Absence check using state equation in 19393 ms returned sat
[2020-06-03 01:29:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 32
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 01:29:15] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 01:29:15] [INFO ] Flatten gal took : 544 ms
FORMULA CloudReconfiguration-PT-314-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-314-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-314-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-314-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-314-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:29:15] [INFO ] Applying decomposition
[2020-06-03 01:29:15] [INFO ] Flatten gal took : 229 ms
[2020-06-03 01:29:16] [INFO ] Decomposing Gal with order
[2020-06-03 01:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 01:29:16] [INFO ] Removed a total of 123 redundant transitions.
[2020-06-03 01:29:16] [INFO ] Flatten gal took : 369 ms
[2020-06-03 01:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 32 ms.
[2020-06-03 01:29:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2020-06-03 01:29:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 81 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudReconfiguration-PT-314 @ 3570 seconds

FORMULA CloudReconfiguration-PT-314-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-314-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3475
rslt: Output for LTLFireability @ CloudReconfiguration-PT-314

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 01:29:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 316
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 316
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p1693 <= 0))",
"processed_size": 14,
"rewrites": 71
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 348
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p2272)))) U ((1 <= p1693)))",
"processed_size": 41,
"rewrites": 69
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 348
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (G (((1 <= p2282)))) AND (((p904 <= 0)) R X (F (((p294 <= 0))))))))",
"processed_size": 76,
"rewrites": 69
},
"result":
{
"edges": 72,
"markings": 72,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 386
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p1353) AND ((p864 <= 0)))) AND (((p864 <= 0)) R X (((p915 <= 0))))))",
"processed_size": 82,
"rewrites": 69
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p630))) AND ((X (((X (((1 <= p626))) OR ((1 <= p630))) U ((1 <= p1003)))) AND ((1 <= p1893))) OR ((1 <= p630))))))",
"processed_size": 131,
"rewrites": 69
},
"result":
{
"edges": 73,
"markings": 72,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 497
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((X (((p299 <= 0))) R (((1 <= p1244)) R ((1 <= p299)))) OR ((p1263 <= 0)))))",
"processed_size": 82,
"rewrites": 69
},
"result":
{
"edges": 172,
"markings": 163,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 580
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 580
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p1230 <= 0)) AND ((p784 <= 0)))",
"processed_size": 34,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p1397))))",
"processed_size": 22,
"rewrites": 69
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 695
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p2211))))",
"processed_size": 22,
"rewrites": 69
},
"result":
{
"edges": 59,
"markings": 58,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 869
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F (((p2490 <= 0))))",
"processed_size": 22,
"rewrites": 69
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 869
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 869
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p438))",
"processed_size": 13,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1159
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((F (((1 <= p1948))) U ((1 <= p186))) OR ((1 <= p572) AND (1 <= p1153))))",
"processed_size": 76,
"rewrites": 69
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1159
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p544))))",
"processed_size": 21,
"rewrites": 69
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1739
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p859))))",
"processed_size": 21,
"rewrites": 69
},
"result":
{
"edges": 59,
"markings": 58,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3479
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p2139 <= 0)))",
"processed_size": 18,
"rewrites": 69
},
"result":
{
"edges": 120676,
"markings": 94336,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 99064,
"runtime": 95.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((X(G(**)) U **) OR (G(**) AND F(**))) : G(F((X(G(**)) AND (* R X(F(*)))))) : G((F(*) AND (* R X(*)))) : F(G((F(**) AND ((X(((X(**) OR **) U **)) AND **) OR **)))) : F(G(**)) : X(G(((X(*) R (* R *)) OR *))) : G(**) : (X(F(**)) AND (** AND **)) : (X(F(*)) OR F(G(**))) : G(F(**)) : (X(((F(**) U **) OR **)) OR **)"
},
"net":
{
"arcs": 6463,
"conflict_clusters": 2448,
"places": 2585,
"places_significant": 2581,
"singleton_clusters": 0,
"transitions": 3095
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no ",
"value": "no no no no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5680/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2585
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p2272 <= 1)
lola: LP says that atomic proposition is always true: (p2272 <= 1)
lola: LP says that atomic proposition is always true: (p1693 <= 1)
lola: LP says that atomic proposition is always true: (p2282 <= 1)
lola: LP says that atomic proposition is always true: (p904 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p598 <= 1)
lola: LP says that atomic proposition is always true: (p1353 <= 1)
lola: LP says that atomic proposition is always true: (p864 <= 1)
lola: LP says that atomic proposition is always true: (p864 <= 1)
lola: LP says that atomic proposition is always true: (p915 <= 1)
lola: LP says that atomic proposition is always true: (p626 <= 1)
lola: LP says that atomic proposition is always true: (p630 <= 1)
lola: LP says that atomic proposition is always true: (p1003 <= 1)
lola: LP says that atomic proposition is always true: (p1893 <= 1)
lola: LP says that atomic proposition is always true: (p630 <= 1)
lola: LP says that atomic proposition is always true: (p993 <= 1)
lola: LP says that atomic proposition is always true: (p500 <= 1)
lola: LP says that atomic proposition is always true: (p1346 <= 1)
lola: LP says that atomic proposition is always true: (p859 <= 1)
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p1244 <= 1)
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p1263 <= 1)
lola: LP says that atomic proposition is always true: (p2139 <= 1)
lola: LP says that atomic proposition is always true: (p1397 <= 1)
lola: LP says that atomic proposition is always true: (p1397 <= 1)
lola: LP says that atomic proposition is always true: (p1230 <= 1)
lola: LP says that atomic proposition is always true: (p784 <= 1)
lola: LP says that atomic proposition is always true: (p2490 <= 1)
lola: LP says that atomic proposition is always true: (p2211 <= 1)
lola: LP says that atomic proposition is always true: (p544 <= 1)
lola: LP says that atomic proposition is always true: (p1948 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1153 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: (G (((p2272 <= 0))) U (G (X (G (((1 <= p2272))))) U ((1 <= p1693)))) : G (X (F ((G (X (((1 <= p2282)))) AND NOT((((1 <= p904)) U G (X (((1 <= p294)))))))))) : NOT((((1 <= p572) AND (1 <= p598)) U F ((G (((p1353 <= 0) OR ((1 <= p864)))) OR (((1 <= p864)) U X (((1 <= p915)))))))) : X (F (G (((X (((X (((1 <= p626))) OR ((1 <= p630))) U ((1 <= p1003)))) AND ((1 <= p1893))) U ((1 <= p630)))))) : F ((G (X ((NOT(F (((1 <= p993)))) AND (((1 <= p500)) OR ((1 <= p1346)))))) U F (X (G (((1 <= p859))))))) : NOT(F (X (((X (((1 <= p299))) U (((p1244 <= 0)) U ((p299 <= 0)))) AND ((1 <= p1263)))))) : G (((p2139 <= 0))) : ((((0 <= 0) U X ((((p1397 <= 0)) U ((1 <= p1397))))) AND ((p1230 <= 0))) AND ((p784 <= 0))) : (X (NOT(G (((1 <= p2490))))) OR F (G (((1 <= p2211))))) : F (NOT(G (X (NOT(F (G (F (((1 <= p544)))))))))) : (((NOT(G (NOT(X (((1 <= p1948)))))) U X (((1 <= p186)))) OR X (((1 <= p572) AND (1 <= p1153)))) OR ((1 <= p438)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p2272)))) U ((1 <= p1693))) OR (G (((p2272 <= 0))) AND F (((1 <= p1693)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1693)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1693 <= 0))
lola: processed formula length: 14
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 57 markings, 57 edges
lola: ========================================
lola: subprocess 1 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p2272)))) U ((1 <= p1693)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p2272)))) U ((1 <= p1693)))
lola: processed formula length: 41
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 71 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G (((1 <= p2282)))) AND (((p904 <= 0)) R X (F (((p294 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G (((1 <= p2282)))) AND (((p904 <= 0)) R X (F (((p294 <= 0))))))))
lola: processed formula length: 76
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72 markings, 72 edges
lola: ========================================
lola: subprocess 2 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p1353) AND ((p864 <= 0)))) AND (((p864 <= 0)) R X (((p915 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p1353) AND ((p864 <= 0)))) AND (((p864 <= 0)) R X (((p915 <= 0))))))
lola: processed formula length: 82
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 71 markings, 71 edges
lola: ========================================
lola: subprocess 3 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p630))) AND ((X (((X (((1 <= p626))) OR ((1 <= p630))) U ((1 <= p1003)))) AND ((1 <= p1893))) OR ((1 <= p630))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p630))) AND ((X (((X (((1 <= p626))) OR ((1 <= p630))) U ((1 <= p1003)))) AND ((1 <= p1893))) OR ((1 <= p630))))))
lola: processed formula length: 131
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72 markings, 73 edges
lola: ========================================
lola: subprocess 4 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X (((p299 <= 0))) R (((1 <= p1244)) R ((1 <= p299)))) OR ((p1263 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X (((p299 <= 0))) R (((1 <= p1244)) R ((1 <= p299)))) OR ((p1263 <= 0)))))
lola: processed formula length: 82
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 163 markings, 172 edges
lola: subprocess 5 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p1397)))) AND (((p1230 <= 0)) AND ((p784 <= 0))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1230 <= 0)) AND ((p784 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p1230 <= 0)) AND ((p784 <= 0)))
lola: processed formula length: 34
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p1397))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p1397))))
lola: processed formula length: 22
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 71 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p2490 <= 0)))) OR F (G (((1 <= p2211)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p2211))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p2211))))
lola: processed formula length: 22
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 58 markings, 59 edges
lola: ========================================
lola: subprocess 7 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p2490 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p2490 <= 0))))
lola: processed formula length: 22
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((F (((1 <= p1948))) U ((1 <= p186))) OR ((1 <= p572) AND (1 <= p1153)))) OR ((1 <= p438)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p438))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p438))
lola: processed formula length: 13
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 1159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F (((1 <= p1948))) U ((1 <= p186))) OR ((1 <= p572) AND (1 <= p1153))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F (((1 <= p1948))) U ((1 <= p186))) OR ((1 <= p572) AND (1 <= p1153))))
lola: processed formula length: 76
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 71 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p544))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p544))))
lola: processed formula length: 21
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 57 markings, 57 edges
lola: ========================================
lola: subprocess 9 will run for 1739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p859))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p859))))
lola: processed formula length: 21
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 58 markings, 59 edges
lola: ========================================
lola: subprocess 10 will run for 3479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p2139 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p2139 <= 0)))
lola: processed formula length: 18
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 94336 markings, 120676 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no
lola:
preliminary result: no no no no no no no no yes no no
lola: memory consumption: 99064 KB
lola: time consumption: 95 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

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="CloudReconfiguration-PT-314"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is CloudReconfiguration-PT-314, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899700106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-314.tgz
mv CloudReconfiguration-PT-314 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;