About the Execution of ITS-LoLa for PolyORBLF-PT-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.830 | 3600000.00 | 3638704.00 | 543.30 | ????T????F??TTF? | normal |
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.r176-tajo-158987871800426.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 PolyORBLF-PT-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871800426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.3K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 04:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 04:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.0K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 9 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBLF-PT-S02J04T10-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-15
=== Now, execution of the tool begins
BK_START 1591152598906
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:50:00] [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 02:50:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:50:00] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-03 02:50:00] [INFO ] Transformed 752 places.
[2020-06-03 02:50:00] [INFO ] Transformed 1572 transitions.
[2020-06-03 02:50:00] [INFO ] Parsed PT model containing 752 places and 1572 transitions in 143 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 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 14 resets, run finished after 725 ms. (steps per millisecond=137 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 02:50:01] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2020-06-03 02:50:01] [INFO ] Computed 54 place invariants in 137 ms
[2020-06-03 02:50:01] [INFO ] [Real]Absence check using 15 positive place invariants in 43 ms returned sat
[2020-06-03 02:50:01] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 60 ms returned sat
[2020-06-03 02:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:50:05] [INFO ] [Real]Absence check using state equation in 3961 ms returned sat
[2020-06-03 02:50:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:50:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-03 02:50:06] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 56 ms returned sat
[2020-06-03 02:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:50:09] [INFO ] [Nat]Absence check using state equation in 3004 ms returned sat
[2020-06-03 02:50:09] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-03 02:50:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:50:13] [INFO ] [Nat]Added 130 Read/Feed constraints in 3909 ms returned sat
[2020-06-03 02:50:13] [INFO ] Deduced a trap composed of 66 places in 140 ms
[2020-06-03 02:50:13] [INFO ] Deduced a trap composed of 67 places in 125 ms
[2020-06-03 02:50:15] [INFO ] Deduced a trap composed of 418 places in 495 ms
[2020-06-03 02:50:16] [INFO ] Deduced a trap composed of 67 places in 91 ms
[2020-06-03 02:50:16] [INFO ] Deduced a trap composed of 66 places in 44 ms
[2020-06-03 02:50:17] [INFO ] Deduced a trap composed of 65 places in 107 ms
[2020-06-03 02:50:18] [INFO ] Deduced a trap composed of 65 places in 557 ms
[2020-06-03 02:50:19] [INFO ] Deduced a trap composed of 418 places in 367 ms
[2020-06-03 02:50:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6556 ms
[2020-06-03 02:50:19] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 147 ms.
[2020-06-03 02:50:25] [INFO ] Added : 40 causal constraints over 8 iterations in 6369 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 02:50:26] [INFO ] [Real]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-03 02:50:26] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 50 ms returned unsat
[2020-06-03 02:50:26] [INFO ] [Real]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-03 02:50:26] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned unsat
[2020-06-03 02:50:26] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned sat
[2020-06-03 02:50:26] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 40 ms returned sat
[2020-06-03 02:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:50:29] [INFO ] [Real]Absence check using state equation in 3174 ms returned sat
[2020-06-03 02:50:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:50:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 02:50:29] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 41 ms returned sat
[2020-06-03 02:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:50:38] [INFO ] [Nat]Absence check using state equation in 8971 ms returned sat
[2020-06-03 02:50:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:50:44] [INFO ] [Nat]Added 130 Read/Feed constraints in 6027 ms returned unknown
[2020-06-03 02:50:44] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-06-03 02:50:45] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-03 02:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:50:48] [INFO ] [Real]Absence check using state equation in 3974 ms returned sat
[2020-06-03 02:50:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:50:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-03 02:50:49] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 44 ms returned sat
[2020-06-03 02:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:50:56] [INFO ] [Nat]Absence check using state equation in 7012 ms returned sat
[2020-06-03 02:50:56] [INFO ] [Nat]Added 130 Read/Feed constraints in 537 ms returned sat
[2020-06-03 02:50:57] [INFO ] Deduced a trap composed of 66 places in 287 ms
[2020-06-03 02:50:57] [INFO ] Deduced a trap composed of 65 places in 280 ms
[2020-06-03 02:51:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:51:01] [INFO ] Deduced a trap composed of 65 places in 153 ms
[2020-06-03 02:51:01] [INFO ] Deduced a trap composed of 65 places in 150 ms
[2020-06-03 02:51:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5467 ms
[2020-06-03 02:51:02] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 166 ms.
[2020-06-03 02:51:09] [INFO ] Added : 30 causal constraints over 6 iterations in 6825 ms. Result :unknown
[2020-06-03 02:51:09] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-06-03 02:51:09] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 32 ms returned sat
[2020-06-03 02:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:51:11] [INFO ] [Real]Absence check using state equation in 2438 ms returned sat
[2020-06-03 02:51:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:51:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-06-03 02:51:11] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 34 ms returned sat
[2020-06-03 02:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:51:16] [INFO ] [Nat]Absence check using state equation in 4295 ms returned sat
[2020-06-03 02:51:16] [INFO ] [Nat]Added 130 Read/Feed constraints in 786 ms returned sat
[2020-06-03 02:51:17] [INFO ] Deduced a trap composed of 65 places in 192 ms
[2020-06-03 02:51:17] [INFO ] Deduced a trap composed of 65 places in 150 ms
[2020-06-03 02:51:20] [INFO ] Deduced a trap composed of 65 places in 165 ms
[2020-06-03 02:51:21] [INFO ] Deduced a trap composed of 65 places in 204 ms
[2020-06-03 02:51:22] [INFO ] Deduced a trap composed of 65 places in 116 ms
[2020-06-03 02:51:23] [INFO ] Deduced a trap composed of 67 places in 106 ms
[2020-06-03 02:51:24] [INFO ] Deduced a trap composed of 66 places in 52 ms
[2020-06-03 02:51:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7594 ms
[2020-06-03 02:51:24] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 133 ms.
[2020-06-03 02:51:30] [INFO ] Added : 20 causal constraints over 4 iterations in 6488 ms. Result :unknown
[2020-06-03 02:51:31] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-03 02:51:31] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 58 ms returned sat
[2020-06-03 02:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:51:34] [INFO ] [Real]Absence check using state equation in 3003 ms returned sat
[2020-06-03 02:51:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:51:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-03 02:51:34] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned sat
[2020-06-03 02:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:51:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:51:45] [INFO ] [Nat]Absence check using state equation in 11305 ms returned unknown
[2020-06-03 02:51:45] [INFO ] [Real]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-03 02:51:45] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 47 ms returned sat
[2020-06-03 02:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:51:48] [INFO ] [Real]Absence check using state equation in 2891 ms returned sat
[2020-06-03 02:51:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:51:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 02:51:48] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned sat
[2020-06-03 02:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:51:52] [INFO ] [Nat]Absence check using state equation in 3564 ms returned sat
[2020-06-03 02:51:53] [INFO ] [Nat]Added 130 Read/Feed constraints in 1194 ms returned sat
[2020-06-03 02:51:53] [INFO ] Deduced a trap composed of 66 places in 160 ms
[2020-06-03 02:51:54] [INFO ] Deduced a trap composed of 66 places in 110 ms
[2020-06-03 02:51:54] [INFO ] Deduced a trap composed of 66 places in 111 ms
[2020-06-03 02:51:55] [INFO ] Deduced a trap composed of 66 places in 72 ms
[2020-06-03 02:51:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2230 ms
[2020-06-03 02:51:55] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 118 ms.
[2020-06-03 02:52:08] [INFO ] Added : 220 causal constraints over 44 iterations in 12860 ms. Result :unknown
[2020-06-03 02:52:08] [INFO ] [Real]Absence check using 15 positive place invariants in 38 ms returned sat
[2020-06-03 02:52:08] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 76 ms returned sat
[2020-06-03 02:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:52:13] [INFO ] [Real]Absence check using state equation in 4124 ms returned sat
[2020-06-03 02:52:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:52:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 02:52:13] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 43 ms returned sat
[2020-06-03 02:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:52:17] [INFO ] [Nat]Absence check using state equation in 3816 ms returned sat
[2020-06-03 02:52:17] [INFO ] [Nat]Added 130 Read/Feed constraints in 722 ms returned sat
[2020-06-03 02:52:17] [INFO ] Deduced a trap composed of 65 places in 139 ms
[2020-06-03 02:52:18] [INFO ] Deduced a trap composed of 66 places in 150 ms
[2020-06-03 02:52:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:52:22] [INFO ] Deduced a trap composed of 65 places in 93 ms
[2020-06-03 02:52:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:52:33] [INFO ] Deduced a trap composed of 3 places in 742 ms
[2020-06-03 02:52:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s217 s524 s706) 0)") while checking expression at index 8
[2020-06-03 02:52:33] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-06-03 02:52:33] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 33 ms returned sat
[2020-06-03 02:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:52:36] [INFO ] [Real]Absence check using state equation in 2900 ms returned sat
[2020-06-03 02:52:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:52:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 02:52:37] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 43 ms returned sat
[2020-06-03 02:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:52:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:52:49] [INFO ] [Nat]Absence check using state equation in 12265 ms returned unknown
[2020-06-03 02:52:49] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-03 02:52:49] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 33 ms returned sat
[2020-06-03 02:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:52:51] [INFO ] [Real]Absence check using state equation in 2512 ms returned sat
[2020-06-03 02:52:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:52:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 44 ms returned sat
[2020-06-03 02:52:52] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 74 ms returned sat
[2020-06-03 02:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:52:59] [INFO ] [Nat]Absence check using state equation in 7599 ms returned sat
[2020-06-03 02:53:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:53:05] [INFO ] [Nat]Added 130 Read/Feed constraints in 6057 ms returned unknown
[2020-06-03 02:53:05] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2020-06-03 02:53:05] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 61 ms returned sat
[2020-06-03 02:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:53:08] [INFO ] [Real]Absence check using state equation in 2355 ms returned sat
[2020-06-03 02:53:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:53:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-03 02:53:08] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 46 ms returned sat
[2020-06-03 02:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:53:13] [INFO ] [Nat]Absence check using state equation in 5345 ms returned sat
[2020-06-03 02:53:14] [INFO ] [Nat]Added 130 Read/Feed constraints in 699 ms returned sat
[2020-06-03 02:53:14] [INFO ] Deduced a trap composed of 65 places in 340 ms
[2020-06-03 02:53:15] [INFO ] Deduced a trap composed of 65 places in 256 ms
[2020-06-03 02:53:16] [INFO ] Deduced a trap composed of 66 places in 263 ms
[2020-06-03 02:53:16] [INFO ] Deduced a trap composed of 65 places in 228 ms
[2020-06-03 02:53:17] [INFO ] Deduced a trap composed of 65 places in 181 ms
[2020-06-03 02:53:17] [INFO ] Deduced a trap composed of 66 places in 148 ms
[2020-06-03 02:53:18] [INFO ] Deduced a trap composed of 66 places in 95 ms
[2020-06-03 02:53:18] [INFO ] Deduced a trap composed of 66 places in 110 ms
[2020-06-03 02:53:19] [INFO ] Deduced a trap composed of 65 places in 70 ms
[2020-06-03 02:53:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4589 ms
[2020-06-03 02:53:19] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 78 ms.
[2020-06-03 02:53:28] [INFO ] Added : 15 causal constraints over 3 iterations in 9210 ms. Result :unknown
[2020-06-03 02:53:28] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-06-03 02:53:28] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 34 ms returned sat
[2020-06-03 02:53:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:53:31] [INFO ] [Real]Absence check using state equation in 2876 ms returned sat
[2020-06-03 02:53:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:53:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 02:53:31] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned sat
[2020-06-03 02:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:53:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:53:42] [INFO ] [Nat]Absence check using state equation in 11243 ms returned unknown
[2020-06-03 02:53:42] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-03 02:53:42] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned sat
[2020-06-03 02:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:53:46] [INFO ] [Real]Absence check using state equation in 3965 ms returned sat
[2020-06-03 02:53:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:53:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-06-03 02:53:47] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned sat
[2020-06-03 02:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:53:51] [INFO ] [Nat]Absence check using state equation in 4348 ms returned sat
[2020-06-03 02:53:52] [INFO ] [Nat]Added 130 Read/Feed constraints in 587 ms returned sat
[2020-06-03 02:53:52] [INFO ] Deduced a trap composed of 66 places in 66 ms
[2020-06-03 02:53:52] [INFO ] Deduced a trap composed of 66 places in 52 ms
[2020-06-03 02:53:52] [INFO ] Deduced a trap composed of 65 places in 68 ms
[2020-06-03 02:53:53] [INFO ] Deduced a trap composed of 66 places in 68 ms
[2020-06-03 02:53:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1474 ms
[2020-06-03 02:53:53] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 103 ms.
[2020-06-03 02:54:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t310 0) (or (and (> t696 0) (< o696 o310)) (and (> t738 0) (< o738 o310))))") while checking expression at index 13
[2020-06-03 02:54:07] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-06-03 02:54:07] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned sat
[2020-06-03 02:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:09] [INFO ] [Real]Absence check using state equation in 2468 ms returned sat
[2020-06-03 02:54:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:54:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-03 02:54:09] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned sat
[2020-06-03 02:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:14] [INFO ] [Nat]Absence check using state equation in 4333 ms returned sat
[2020-06-03 02:54:15] [INFO ] [Nat]Added 130 Read/Feed constraints in 884 ms returned sat
[2020-06-03 02:54:15] [INFO ] Deduced a trap composed of 233 places in 553 ms
[2020-06-03 02:54:16] [INFO ] Deduced a trap composed of 65 places in 456 ms
[2020-06-03 02:54:16] [INFO ] Deduced a trap composed of 405 places in 538 ms
[2020-06-03 02:54:17] [INFO ] Deduced a trap composed of 428 places in 505 ms
[2020-06-03 02:54:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2882 ms
[2020-06-03 02:54:18] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 123 ms.
[2020-06-03 02:54:29] [INFO ] Added : 160 causal constraints over 32 iterations in 11777 ms. Result :unknown
[2020-06-03 02:54:29] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 02:54:29] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned unsat
[2020-06-03 02:54:29] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned sat
[2020-06-03 02:54:29] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned unsat
[2020-06-03 02:54:30] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-06-03 02:54:30] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 53 ms returned sat
[2020-06-03 02:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:32] [INFO ] [Real]Absence check using state equation in 2398 ms returned sat
[2020-06-03 02:54:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:54:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-03 02:54:32] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 77 ms returned sat
[2020-06-03 02:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:54:43] [INFO ] [Nat]Absence check using state equation in 10381 ms returned sat
[2020-06-03 02:54:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:54:47] [INFO ] [Nat]Added 130 Read/Feed constraints in 4185 ms returned sat
[2020-06-03 02:54:47] [INFO ] Deduced a trap composed of 65 places in 186 ms
[2020-06-03 02:54:47] [INFO ] Deduced a trap composed of 65 places in 179 ms
[2020-06-03 02:54:47] [INFO ] Deduced a trap composed of 65 places in 144 ms
[2020-06-03 02:54:48] [INFO ] Deduced a trap composed of 65 places in 142 ms
[2020-06-03 02:54:48] [INFO ] Deduced a trap composed of 66 places in 95 ms
[2020-06-03 02:54:48] [INFO ] Deduced a trap composed of 65 places in 59 ms
[2020-06-03 02:54:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1729 ms
[2020-06-03 02:54:49] [INFO ] Computed and/alt/rep : 1410/21238/1390 causal constraints in 106 ms.
[2020-06-03 02:54:52] [INFO ] Added : 10 causal constraints over 2 iterations in 3542 ms. Result :unknown
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-06-03 02:54:52] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 02:54:52] [INFO ] Flatten gal took : 172 ms
FORMULA PolyORBLF-PT-S02J04T10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:54:53] [INFO ] Flatten gal took : 74 ms
[2020-06-03 02:54:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2020-06-03 02:54:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 37 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PolyORBLF-PT-S02J04T10 @ 3570 seconds
check_solution: Variable C414 = -0.313817977905 is below its lower bound 0
check_solution: Variable C792 = -0.0205710828304 is below its lower bound 0
check_solution: Constraint R2 = 4.67022680704e-310 is above its equality of -1
check_solution: Constraint R5 = 3.70500465174e-311 is above its equality of -1
check_solution: Constraint R13 = 3.46946311862e-311 is above its equality of -1
check_solution: Constraint R21 = 1.70184062521e-311 is above its equality of -1
check_solution: Constraint R22 = 4.34796937677e-311 is above its equality of -1
check_solution: Constraint R32 = 0.413107633591 is above its equality of -1
check_solution: Constraint R50 = 3.44612116491e-311 is above its equality of -10
check_solution: Constraint R64 = 4.60048687581e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 35.4696)
check_solution: Constraint R2 = 4.67022881522e-310 is above its equality of -1
check_solution: Constraint R5 = 3.89386227729e-311 is above its equality of -1
check_solution: Constraint R13 = 3.99996206709e-311 is above its equality of -1
check_solution: Constraint R21 = 4.45831315816e-311 is above its equality of -1
check_solution: Constraint R22 = 3.55009895947e-311 is above its equality of -1
check_solution: Constraint R32 = 3.81959242455e-311 is above its equality of -1
check_solution: Constraint R50 = 6.07315195474e-311 is above its equality of -10
check_solution: Constraint R64 = 3.11508982211e-311 is above its equality of -1
check_solution: Constraint R86 = -0.278000831604 is below its equality of 0
check_solution: Constraint R99 = 5.81851246002e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C400 = -1 is below its lower bound 0
check_solution: Variable C830 = -1 is below its lower bound 0
check_solution: Variable C1102 = -1 is below its lower bound 0
check_solution: Variable C1710 = -1 is below its lower bound 0
check_solution: Constraint R102 = 0 is above its equality of -1
check_solution: Constraint R189 = 0 is above its equality of -1
check_solution: Constraint R256 = 29.025 is above its equality of 0
check_solution: Constraint R336 = 49.6350132045 is above its equality of 0
check_solution: Constraint R437 = 0 is above its equality of -1
check_solution: Constraint R727 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 51.9077 (rel. error 24.8175)
check_solution: Variable C2 = -0.941955372474 is below its lower bound 0
check_solution: Variable C3 = -0.987277840974 is below its lower bound 0
check_solution: Variable C5 = -1 is below its lower bound 0
check_solution: Variable C8 = -0.908423529275 is below its lower bound 0
check_solution: Variable C9 = -0.882991600418 is below its lower bound 0
check_solution: Variable C10 = -1 is below its lower bound 0
check_solution: Variable C14 = -1 is below its lower bound 0
check_solution: Variable C16 = -0.873579084041 is below its lower bound 0
check_solution: Variable C18 = -0.950495327705 is below its lower bound 0
check_solution: Variable C20 = -1 is below its lower bound 0
Seriously low accuracy found ||*|| = 10.7047 (rel. error 2)
check_solution: Constraint R2 = 4.67024706388e-310 is above its equality of -1
check_solution: Constraint R5 = 16.6476710774 is above its equality of -1
check_solution: Constraint R6 = 65.7636929104 is above its equality of 0
check_solution: Constraint R7 = 5.59736795003 is above its equality of 0
check_solution: Constraint R8 = 18.0349770005 is above its equality of 0
check_solution: Constraint R9 = 6.42349945263 is above its equality of 0
check_solution: Constraint R10 = 67.780984104 is above its equality of 0
check_solution: Constraint R11 = 19.4222829236 is above its equality of 0
check_solution: Constraint R12 = 10.7943007819 is above its equality of 0
check_solution: Constraint R13 = 20.8095888468 is above its equality of -1
Seriously low accuracy found ||*|| = 106.355 (rel. error 80.1582)
check_solution: Variable C746 = -0.00480241328478 is below its lower bound 0
check_solution: Variable C1124 = -0.0672083497048 is below its lower bound 0
check_solution: Variable C1880 = -0.175055861473 is below its lower bound 0
check_solution: Constraint R2 = 4.67024855614e-310 is above its equality of -1
check_solution: Constraint R5 = 3.6795407025e-311 is above its equality of -1
check_solution: Constraint R13 = 5.15644977337e-311 is above its equality of -1
check_solution: Constraint R21 = 5.59570290207e-311 is above its equality of -1
check_solution: Constraint R22 = 5.43867521341e-311 is above its equality of -1
check_solution: Constraint R32 = 5.68694872083e-311 is above its equality of -1
check_solution: Constraint R50 = 3.29333746899e-311 is above its equality of -10
Seriously low accuracy found ||*|| = 10 (rel. error 5.71246)
check_solution: Variable C12 = -0.403458238714 is below its lower bound 0
check_solution: Variable C47 = -0.944164360002 is below its lower bound 0
check_solution: Variable C50 = -1.03506931337 is below its lower bound 0
check_solution: Variable C68 = -0.991388667094 is below its lower bound 0
check_solution: Variable C71 = -1.04830393687 is below its lower bound 0
check_solution: Variable C78 = -0.749269758903 is below its lower bound 0
check_solution: Variable C90 = -0.991388667094 is below its lower bound 0
check_solution: Variable C102 = -0.403458238714 is below its lower bound 0
check_solution: Variable C137 = -1.03506931337 is below its lower bound 0
check_solution: Variable C183 = -0.991388667094 is below its lower bound 0
Seriously low accuracy found ||*|| = 10 (rel. error 9.2148)
check_solution: Variable C154 = -0.453640460968 is below its lower bound 0
check_solution: Variable C532 = -0.848199844361 is below its lower bound 0
check_solution: Variable C910 = -0.534783363342 is below its lower bound 0
check_solution: Variable C1666 = -0.142164707184 is below its lower bound 0
check_solution: Variable C2044 = -0.245229721069 is below its lower bound 0
check_solution: Constraint R2 = 4.67025206207e-310 is above its equality of -1
check_solution: Constraint R5 = 4.07635391546e-311 is above its equality of -1
check_solution: Constraint R13 = 5.21162166396e-311 is above its equality of -1
check_solution: Constraint R21 = 3.96813212972e-311 is above its equality of -1
check_solution: Constraint R22 = 3.44824316164e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 7.03409)
check_solution: Constraint R2 = 4.6702528142e-310 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R13 = 0 is above its equality of -1
check_solution: Constraint R21 = 0 is above its equality of -1
check_solution: Constraint R22 = 0 is above its equality of -1
check_solution: Constraint R32 = 0 is above its equality of -1
check_solution: Constraint R50 = 0 is above its equality of -10
check_solution: Constraint R64 = 0 is above its equality of -1
check_solution: Constraint R99 = 0 is above its equality of -1
check_solution: Constraint R102 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C8 = -0.477944135666 is below its lower bound 0
check_solution: Variable C386 = -0.516408920288 is below its lower bound 0
check_solution: Variable C1142 = -1.06615924835 is below its lower bound 0
check_solution: Variable C1898 = -1.56357860565 is below its lower bound 0
check_solution: Constraint R2 = 4.6702528899e-310 is above its equality of -1
check_solution: Constraint R4 = 0.209100961685 is above its equality of 0
check_solution: Constraint R5 = 4.135181236e-319 is above its equality of -1
check_solution: Constraint R13 = 5.08217992066e-311 is above its equality of -1
check_solution: Constraint R21 = 3.74107858042e-311 is above its equality of -1
check_solution: Constraint R22 = 5.18615771454e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 3.05763)
check_solution: Constraint R2 = 4.67025294219e-310 is above its equality of -1
check_solution: Constraint R5 = 1.03383634959e-310 is above its equality of -1
check_solution: Constraint R13 = 2.56549291187e-311 is above its equality of -1
check_solution: Constraint R21 = 4.56441294742e-311 is above its equality of -1
check_solution: Constraint R22 = 4.69385469068e-311 is above its equality of -1
check_solution: Constraint R32 = 7.10019791817e-311 is above its equality of -1
check_solution: Constraint R50 = 1.14014833874e-310 is above its equality of -10
check_solution: Constraint R64 = 4.18669769649e-311 is above its equality of -1
check_solution: Constraint R99 = 6.15590979098e-311 is above its equality of -1
check_solution: Constraint R102 = 7.69011274822e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 67.2795 (rel. error 33.6398)
check_solution: Variable C300 = -1 is below its lower bound 0
check_solution: Variable C730 = -1 is below its lower bound 0
check_solution: Variable C1002 = -1 is below its lower bound 0
check_solution: Variable C1610 = -1 is below its lower bound 0
check_solution: Variable C2099 = -1 is below its lower bound 0
check_solution: Constraint R2 = 4.67025483111e-310 is above its equality of -1
check_solution: Constraint R5 = 6.36598737438e-314 is above its equality of -1
check_solution: Constraint R13 = 6.36598737438e-314 is above its equality of -1
check_solution: Constraint R21 = 6.36598737438e-314 is above its equality of -1
check_solution: Constraint R22 = 6.36598737438e-314 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 11221932 kB
After kill :
MemTotal: 16427488 kB
MemFree: 16141180 kB
--------------------
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="PolyORBLF-PT-S02J04T10"
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 PolyORBLF-PT-S02J04T10, 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 r176-tajo-158987871800426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 '
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 ;