fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r011-tall-162038005800006
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ASLink-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4324.071 3600000.00 299410.00 1029.20 FFTFTTFFTTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038005800006.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ASLink-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005800006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 201K May 5 16:51 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 ASLink-PT-01a-00
FORMULA_NAME ASLink-PT-01a-01
FORMULA_NAME ASLink-PT-01a-02
FORMULA_NAME ASLink-PT-01a-03
FORMULA_NAME ASLink-PT-01a-04
FORMULA_NAME ASLink-PT-01a-05
FORMULA_NAME ASLink-PT-01a-06
FORMULA_NAME ASLink-PT-01a-07
FORMULA_NAME ASLink-PT-01a-08
FORMULA_NAME ASLink-PT-01a-09
FORMULA_NAME ASLink-PT-01a-10
FORMULA_NAME ASLink-PT-01a-11
FORMULA_NAME ASLink-PT-01a-12
FORMULA_NAME ASLink-PT-01a-13
FORMULA_NAME ASLink-PT-01a-14
FORMULA_NAME ASLink-PT-01a-15

=== Now, execution of the tool begins

BK_START 1620391722181

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 12:48:43] [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]
[2021-05-07 12:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:48:44] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-07 12:48:44] [INFO ] Transformed 431 places.
[2021-05-07 12:48:44] [INFO ] Transformed 735 transitions.
[2021-05-07 12:48:44] [INFO ] Found NUPN structural information;
[2021-05-07 12:48:44] [INFO ] Parsed PT model containing 431 places and 735 transitions in 134 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1920 resets, run finished after 436 ms. (steps per millisecond=229 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 728 rows 431 cols
[2021-05-07 12:48:44] [INFO ] Computed 80 place invariants in 48 ms
[2021-05-07 12:48:44] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 12:48:44] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 35 ms returned sat
[2021-05-07 12:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:45] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2021-05-07 12:48:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 42 ms returned sat
[2021-05-07 12:48:45] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 12:48:55] [INFO ] [Nat]Absence check using state equation in 9426 ms returned unknown
[2021-05-07 12:48:55] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-07 12:48:55] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:56] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2021-05-07 12:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 37 ms returned sat
[2021-05-07 12:48:56] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:57] [INFO ] [Nat]Absence check using state equation in 1592 ms returned unsat
[2021-05-07 12:48:57] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:48:57] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:58] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2021-05-07 12:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:48:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:48:58] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:48:59] [INFO ] [Nat]Absence check using state equation in 581 ms returned unsat
[2021-05-07 12:48:59] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-07 12:48:59] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:00] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2021-05-07 12:49:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:00] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:00] [INFO ] [Nat]Absence check using state equation in 389 ms returned unsat
[2021-05-07 12:49:00] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:00] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:01] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2021-05-07 12:49:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 36 ms returned sat
[2021-05-07 12:49:01] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:02] [INFO ] [Nat]Absence check using state equation in 584 ms returned unsat
[2021-05-07 12:49:02] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-07 12:49:02] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:02] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2021-05-07 12:49:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:02] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:03] [INFO ] [Nat]Absence check using state equation in 553 ms returned unsat
[2021-05-07 12:49:03] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:03] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:04] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2021-05-07 12:49:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 29 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:04] [INFO ] [Nat]Absence check using state equation in 266 ms returned unsat
[2021-05-07 12:49:04] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:05] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2021-05-07 12:49:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:05] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:06] [INFO ] [Nat]Absence check using state equation in 430 ms returned unsat
[2021-05-07 12:49:06] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:06] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:06] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2021-05-07 12:49:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:06] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:07] [INFO ] [Nat]Absence check using state equation in 464 ms returned unsat
[2021-05-07 12:49:07] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2021-05-07 12:49:07] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:08] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2021-05-07 12:49:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 39 ms returned sat
[2021-05-07 12:49:08] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:09] [INFO ] [Nat]Absence check using state equation in 717 ms returned unsat
[2021-05-07 12:49:09] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2021-05-07 12:49:09] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:09] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2021-05-07 12:49:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:09] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 25 ms returned sat
[2021-05-07 12:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:10] [INFO ] [Nat]Absence check using state equation in 351 ms returned unsat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 9 ms returned unsat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 11 ms returned unsat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:10] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:11] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2021-05-07 12:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 33 ms returned sat
[2021-05-07 12:49:11] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 25 ms returned sat
[2021-05-07 12:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:12] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2021-05-07 12:49:12] [INFO ] Computed and/alt/rep : 727/10383/727 causal constraints in 61 ms.
[2021-05-07 12:49:31] [INFO ] Added : 465 causal constraints over 93 iterations in 19031 ms. Result :(error "Failed to check-sat")
[2021-05-07 12:49:31] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:31] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:32] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2021-05-07 12:49:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:32] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:32] [INFO ] [Nat]Absence check using state equation in 540 ms returned unsat
[2021-05-07 12:49:32] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:32] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 11 ms returned unsat
[2021-05-07 12:49:32] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:32] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 36 ms returned sat
[2021-05-07 12:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:33] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2021-05-07 12:49:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:33] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 58 ms returned sat
[2021-05-07 12:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:34] [INFO ] [Nat]Absence check using state equation in 749 ms returned unsat
[2021-05-07 12:49:34] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:34] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:35] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2021-05-07 12:49:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 69 ms returned sat
[2021-05-07 12:49:35] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:35] [INFO ] [Nat]Absence check using state equation in 184 ms returned unsat
[2021-05-07 12:49:35] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-07 12:49:35] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:36] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2021-05-07 12:49:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:36] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:37] [INFO ] [Nat]Absence check using state equation in 561 ms returned unsat
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:37] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2021-05-07 12:49:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2021-05-07 12:49:39] [INFO ] Deduced a trap composed of 25 places in 131 ms
[2021-05-07 12:49:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2021-05-07 12:49:39] [INFO ] Computed and/alt/rep : 727/10383/727 causal constraints in 51 ms.
[2021-05-07 12:49:50] [INFO ] Added : 265 causal constraints over 53 iterations in 11525 ms. Result :sat
[2021-05-07 12:49:50] [INFO ] Deduced a trap composed of 68 places in 223 ms
[2021-05-07 12:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2021-05-07 12:49:51] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-07 12:49:51] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2021-05-07 12:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:51] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2021-05-07 12:49:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:51] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:52] [INFO ] [Nat]Absence check using state equation in 419 ms returned unsat
[2021-05-07 12:49:52] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:52] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 25 ms returned unsat
[2021-05-07 12:49:52] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-07 12:49:52] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2021-05-07 12:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:53] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2021-05-07 12:49:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-07 12:49:53] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 26 ms returned sat
[2021-05-07 12:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:53] [INFO ] [Nat]Absence check using state equation in 284 ms returned unsat
Successfully simplified 20 atomic propositions for a total of 21 simplifications.
[2021-05-07 12:49:53] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-07 12:49:53] [INFO ] Flatten gal took : 103 ms
FORMULA ASLink-PT-01a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 12:49:53] [INFO ] Applying decomposition
[2021-05-07 12:49:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-07 12:49:53] [INFO ] Flatten gal took : 61 ms
[2021-05-07 12:49:54] [INFO ] Decomposing Gal with order
[2021-05-07 12:49:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:49:54] [INFO ] Removed a total of 954 redundant transitions.
[2021-05-07 12:49:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-07 12:49:54] [INFO ] Flatten gal took : 168 ms
[2021-05-07 12:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 19 ms.
[2021-05-07 12:49:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ASLink-PT-01a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 12:49:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-07 12:49:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ASLink-PT-01a @ 3570 seconds

FORMULA ASLink-PT-01a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-01a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3358
rslt: Output for LTLFireability @ ASLink-PT-01a

{
"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": "Fri May 7 12:49:55 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((F (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261))) U (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261)) U ((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))) AND X (X (((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))))))",
"processed_size": 245,
"rewrites": 50
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 0,
"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": 480
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((2 <= p11) OR (p11 <= 0) OR (2 <= p82) OR (p82 <= 0))))",
"processed_size": 65,
"rewrites": 50
},
"result":
{
"edges": 551318,
"markings": 208445,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"aneg": 3,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p139) AND (1 <= p142) AND (1 <= p145) AND (1 <= p227))) OR (((p162 <= 0) OR (p287 <= 0) OR (p420 <= 0)) AND X (((1 <= p139) AND (1 <= p142) AND (1 <= p145) AND (1 <= p227)))))))",
"processed_size": 196,
"rewrites": 50
},
"result":
{
"edges": 126,
"markings": 126,
"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": 672
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((2 <= p212) OR (p212 <= 0) OR (p273 <= 0))) AND ((2 <= p13) OR (p13 <= 0) OR (2 <= p84) OR (p84 <= 0))))",
"processed_size": 117,
"rewrites": 50
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (G (((1 <= p55) AND (1 <= p125)))) OR G (((1 <= p55) AND (1 <= p125))))))",
"processed_size": 82,
"rewrites": 50
},
"result":
{
"edges": 126,
"markings": 126,
"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": 1121
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1121
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((1 <= p218) AND (1 <= p285))))",
"processed_size": 37,
"rewrites": 50
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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 (F (((1 <= p198) AND (1 <= p226))))",
"processed_size": 37,
"rewrites": 50
},
"result":
{
"edges": 126,
"markings": 126,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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 (F (((1 <= p198) AND (1 <= p226))))",
"processed_size": 37,
"rewrites": 50
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p287 <= 0) OR (p420 <= 0))",
"processed_size": 29,
"rewrites": 52
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((((p18 <= 0) OR (p89 <= 0)) R ((p123 <= 0))) OR (((2 <= p212) OR (p212 <= 0)) OR ((p285 <= 0)))))",
"processed_size": 103,
"rewrites": 50
},
"result":
{
"edges": 910124,
"markings": 394720,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 61596,
"runtime": 212.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((F(**) U (** U **)) AND X(X(**))))) : (X(X((G(**) OR (** OR **)))) AND (X(G(*)) OR **)) : X(F((G(*) OR (* AND X(*))))) : X((F(*) AND **)) : X(F((X(G(**)) OR G(**)))) : (X(F(**)) OR ((X(F(**)) AND F(G(**))) OR X(F(**)))) : G(((* R *) OR (** OR **))) : F(**)"
},
"net":
{
"arcs": 2787,
"conflict_clusters": 132,
"places": 431,
"places_significant": 351,
"singleton_clusters": 0,
"transitions": 728
},
"result":
{
"preliminary_value": "no no no yes no no no no ",
"value": "no no no yes no no 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: 1159/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 431
lola: finding significant places
lola: 431 places, 728 transitions, 351 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: (p348 <= 1)
lola: LP says that atomic proposition is always true: (p348 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: X (G (((F ((X (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261))) U ((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261)))) U (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261)) U ((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))) AND X (X (((p345 <= 1) AND (1 <= p345) AND (1 <= p348))))))) : (X (X (((G (((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82))) OR ((p4 <= 1) AND (1 <= p4) AND (p75 <= 1) AND (1 <= p75))) OR ((1 <= p199) AND (1 <= p201))))) AND (NOT(X (F (((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82))))) OR ((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82)))) : NOT(G (X ((((1 <= p162) AND (1 <= p287) AND (1 <= p420)) U X (((p139 <= 0) OR (p142 <= 0) OR (p145 <= 0) OR (p227 <= 0))))))) : X ((NOT(G (((p212 <= 1) AND (1 <= p212) AND (1 <= p273)))) AND ((2 <= p13) OR (p13 <= 0) OR (2 <= p84) OR (p84 <= 0)))) : NOT(G (X (G ((NOT(X (G (((1 <= p55) AND (1 <= p125))))) AND NOT(G (((1 <= p55) AND (1 <= p125))))))))) : ((X (F (X (G (((1 <= p218) AND (1 <= p285)))))) U X (F (((1 <= p198) AND (1 <= p226))))) OR X (F (((1 <= p198) AND (1 <= p226))))) : G (((NOT((((1 <= p18) AND (1 <= p89)) U ((1 <= p123)))) OR ((2 <= p212) OR (p212 <= 0))) OR ((p285 <= 0)))) : ((0 <= 0) U ((1 <= p287) AND (1 <= p420)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261))) U (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261)) U ((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))) AND X (X (((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261))) U (((p43 <= 1) AND (1 <= p43) AND (p261 <= 1) AND (1 <= p261)) U ((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))) AND X (X (((p345 <= 1) AND (1 <= p345) AND (1 <= p348)))))))
lola: processed formula length: 245
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 1 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((G (((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82))) OR (((p4 <= 1) AND (1 <= p4) AND (p75 <= 1) AND (1 <= p75)) OR ((1 <= p199) AND (1 <= p201)))))) AND (X (G (((2 <= p11) OR (p11 <= 0) OR (2 <= p82) OR (p82 <= 0)))) OR ((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p11 <= 1) AND (1 <= p11) AND (p82 <= 1) AND (1 <= p82))
lola: processed formula length: 57
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 2 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((2 <= p11) OR (p11 <= 0) OR (2 <= p82) OR (p82 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((2 <= p11) OR (p11 <= 0) OR (2 <= p82) OR (p82 <= 0))))
lola: processed formula length: 65
lola: 50 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: 208445 markings, 551318 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p139) AND (1 <= p142) AND (1 <= p145) AND (1 <= p227))) OR (((p162 <= 0) OR (p287 <= 0) OR (p420 <= 0)) AND X (((1 <= p139) AND (1 <= p142) AND (1 <= p145) AND (1 <= p227)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p139) AND (1 <= p142) AND (1 <= p145) AND (1 <= p227))) OR (((p162 <= 0) OR (p287 <= 0) OR (p420 <= 0)) AND X (((1 <= p139) AND (1 <= p142) AND (1 <= p145) AND (1 <= p227)))))))
lola: processed formula length: 196
lola: 50 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 3 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((2 <= p212) OR (p212 <= 0) OR (p273 <= 0))) AND ((2 <= p13) OR (p13 <= 0) OR (2 <= p84) OR (p84 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((2 <= p212) OR (p212 <= 0) OR (p273 <= 0))) AND ((2 <= p13) OR (p13 <= 0) OR (2 <= p84) OR (p84 <= 0))))
lola: processed formula length: 117
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G (((1 <= p55) AND (1 <= p125)))) OR G (((1 <= p55) AND (1 <= p125))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G (((1 <= p55) AND (1 <= p125)))) OR G (((1 <= p55) AND (1 <= p125))))))
lola: processed formula length: 82
lola: 50 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 5 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p198) AND (1 <= p226)))) OR ((X (F (((1 <= p198) AND (1 <= p226)))) AND F (G (((1 <= p218) AND (1 <= p285))))) OR X (F (((1 <= p198) AND (1 <= p226))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p218) AND (1 <= p285))))
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 <= p218) AND (1 <= p285))))
lola: processed formula length: 37
lola: 50 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p198) AND (1 <= p226))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p198) AND (1 <= p226))))
lola: processed formula length: 37
lola: 50 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 7 will run for 3363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p198) AND (1 <= p226))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p198) AND (1 <= p226))))
lola: processed formula length: 37
lola: 50 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: 126 markings, 126 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p287) AND (1 <= p420)))
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: ((p287 <= 0) OR (p420 <= 0))
lola: processed formula length: 29
lola: 52 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 3363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p18 <= 0) OR (p89 <= 0)) R ((p123 <= 0))) OR (((2 <= p212) OR (p212 <= 0)) OR ((p285 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p18 <= 0) OR (p89 <= 0)) R ((p123 <= 0))) OR (((2 <= p212) OR (p212 <= 0)) OR ((p285 <= 0)))))
lola: processed formula length: 103
lola: 50 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: 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: 394720 markings, 910124 edges
lola: RESULT
lola:
SUMMARY: no no no yes no no no no
lola:
preliminary result: no no no yes no no no no
lola: ========================================
lola: memory consumption: 61596 KB
lola: time consumption: 212 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="ASLink-PT-01a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is ASLink-PT-01a, 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 r011-tall-162038005800006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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