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.r210-tajo-159033476100698.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 itstools
Input is ShieldPPPt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100698
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 3.1K May 14 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 13 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 268K May 12 20:42 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 ShieldPPPt-PT-040A-00
FORMULA_NAME ShieldPPPt-PT-040A-01
FORMULA_NAME ShieldPPPt-PT-040A-02
FORMULA_NAME ShieldPPPt-PT-040A-03
FORMULA_NAME ShieldPPPt-PT-040A-04
FORMULA_NAME ShieldPPPt-PT-040A-05
FORMULA_NAME ShieldPPPt-PT-040A-06
FORMULA_NAME ShieldPPPt-PT-040A-07
FORMULA_NAME ShieldPPPt-PT-040A-08
FORMULA_NAME ShieldPPPt-PT-040A-09
FORMULA_NAME ShieldPPPt-PT-040A-10
FORMULA_NAME ShieldPPPt-PT-040A-11
FORMULA_NAME ShieldPPPt-PT-040A-12
FORMULA_NAME ShieldPPPt-PT-040A-13
FORMULA_NAME ShieldPPPt-PT-040A-14
FORMULA_NAME ShieldPPPt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1590613436933

[2020-05-27 21:03:59] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 21:03:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 21:03:59] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2020-05-27 21:03:59] [INFO ] Transformed 1003 places.
[2020-05-27 21:03:59] [INFO ] Transformed 723 transitions.
[2020-05-27 21:03:59] [INFO ] Found NUPN structural information;
[2020-05-27 21:03:59] [INFO ] Parsed PT model containing 1003 places and 723 transitions in 185 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 767 ms. (steps per millisecond=130 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0]
// Phase 1: matrix 722 rows 1003 cols
[2020-05-27 21:04:00] [INFO ] Computed 441 place invariants in 22 ms
[2020-05-27 21:04:00] [INFO ] [Real]Absence check using 441 positive place invariants in 306 ms returned sat
[2020-05-27 21:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:04:02] [INFO ] [Real]Absence check using state equation in 1608 ms returned sat
[2020-05-27 21:04:02] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 60 ms.
[2020-05-27 21:04:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:04:03] [INFO ] [Nat]Absence check using 441 positive place invariants in 236 ms returned sat
[2020-05-27 21:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:04:04] [INFO ] [Nat]Absence check using state equation in 1642 ms returned sat
[2020-05-27 21:04:05] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 35 ms.
[2020-05-27 21:04:22] [INFO ] Added : 713 causal constraints over 145 iterations in 17933 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-27 21:04:23] [INFO ] [Real]Absence check using 441 positive place invariants in 303 ms returned sat
[2020-05-27 21:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:04:25] [INFO ] [Real]Absence check using state equation in 1836 ms returned sat
[2020-05-27 21:04:25] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 54 ms.
[2020-05-27 21:04:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:04:26] [INFO ] [Nat]Absence check using 441 positive place invariants in 281 ms returned sat
[2020-05-27 21:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:04:27] [INFO ] [Nat]Absence check using state equation in 1694 ms returned sat
[2020-05-27 21:04:27] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 45 ms.
[2020-05-27 21:04:42] [INFO ] Added : 715 causal constraints over 148 iterations in 14647 ms. Result :sat
[2020-05-27 21:04:42] [INFO ] [Real]Absence check using 441 positive place invariants in 253 ms returned sat
[2020-05-27 21:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:04:44] [INFO ] [Real]Absence check using state equation in 1646 ms returned sat
[2020-05-27 21:04:44] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 57 ms.
[2020-05-27 21:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:04:45] [INFO ] [Nat]Absence check using 441 positive place invariants in 300 ms returned sat
[2020-05-27 21:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:04:47] [INFO ] [Nat]Absence check using state equation in 1889 ms returned sat
[2020-05-27 21:04:47] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 52 ms.
[2020-05-27 21:05:00] [INFO ] Added : 695 causal constraints over 139 iterations in 13486 ms. Result :sat
[2020-05-27 21:05:01] [INFO ] [Real]Absence check using 441 positive place invariants in 280 ms returned sat
[2020-05-27 21:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:05:03] [INFO ] [Real]Absence check using state equation in 1793 ms returned sat
[2020-05-27 21:05:03] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 54 ms.
[2020-05-27 21:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:05:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 281 ms returned sat
[2020-05-27 21:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:05:05] [INFO ] [Nat]Absence check using state equation in 1666 ms returned sat
[2020-05-27 21:05:05] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 40 ms.
[2020-05-27 21:05:23] [INFO ] Added : 703 causal constraints over 143 iterations in 17874 ms. Result :unknown
[2020-05-27 21:05:24] [INFO ] [Real]Absence check using 441 positive place invariants in 231 ms returned sat
[2020-05-27 21:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:05:26] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2020-05-27 21:05:26] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 57 ms.
[2020-05-27 21:05:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:05:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 325 ms returned sat
[2020-05-27 21:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:05:29] [INFO ] [Nat]Absence check using state equation in 1910 ms returned sat
[2020-05-27 21:05:29] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 57 ms.
[2020-05-27 21:05:44] [INFO ] Added : 711 causal constraints over 144 iterations in 15836 ms. Result :sat
[2020-05-27 21:05:45] [INFO ] [Real]Absence check using 441 positive place invariants in 219 ms returned sat
[2020-05-27 21:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:05:47] [INFO ] [Real]Absence check using state equation in 1686 ms returned sat
[2020-05-27 21:05:47] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 43 ms.
[2020-05-27 21:05:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:05:47] [INFO ] [Nat]Absence check using 441 positive place invariants in 219 ms returned sat
[2020-05-27 21:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:05:49] [INFO ] [Nat]Absence check using state equation in 1597 ms returned sat
[2020-05-27 21:05:49] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 40 ms.
[2020-05-27 21:06:01] [INFO ] Added : 709 causal constraints over 143 iterations in 11939 ms. Result :sat
[2020-05-27 21:06:01] [INFO ] [Real]Absence check using 441 positive place invariants in 277 ms returned sat
[2020-05-27 21:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:06:03] [INFO ] [Real]Absence check using state equation in 1971 ms returned sat
[2020-05-27 21:06:03] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 54 ms.
[2020-05-27 21:06:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:06:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 281 ms returned sat
[2020-05-27 21:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:06:06] [INFO ] [Nat]Absence check using state equation in 2031 ms returned sat
[2020-05-27 21:06:06] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 60 ms.
[2020-05-27 21:06:20] [INFO ] Added : 681 causal constraints over 137 iterations in 14098 ms. Result :sat
[2020-05-27 21:06:21] [INFO ] [Real]Absence check using 441 positive place invariants in 231 ms returned sat
[2020-05-27 21:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:06:22] [INFO ] [Real]Absence check using state equation in 1872 ms returned sat
[2020-05-27 21:06:23] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 35 ms.
[2020-05-27 21:06:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:06:23] [INFO ] [Nat]Absence check using 441 positive place invariants in 197 ms returned sat
[2020-05-27 21:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:06:25] [INFO ] [Nat]Absence check using state equation in 1763 ms returned sat
[2020-05-27 21:06:25] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 39 ms.
[2020-05-27 21:06:39] [INFO ] Added : 702 causal constraints over 141 iterations in 13942 ms. Result :sat
[2020-05-27 21:06:39] [INFO ] [Real]Absence check using 441 positive place invariants in 272 ms returned sat
[2020-05-27 21:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:06:41] [INFO ] [Real]Absence check using state equation in 1803 ms returned sat
[2020-05-27 21:06:41] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 39 ms.
[2020-05-27 21:06:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:06:42] [INFO ] [Nat]Absence check using 441 positive place invariants in 285 ms returned sat
[2020-05-27 21:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:06:44] [INFO ] [Nat]Absence check using state equation in 1777 ms returned sat
[2020-05-27 21:06:44] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 50 ms.
[2020-05-27 21:06:59] [INFO ] Added : 709 causal constraints over 145 iterations in 15792 ms. Result :sat
[2020-05-27 21:07:00] [INFO ] [Real]Absence check using 441 positive place invariants in 283 ms returned sat
[2020-05-27 21:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:07:02] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2020-05-27 21:07:02] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 48 ms.
[2020-05-27 21:07:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:07:02] [INFO ] [Nat]Absence check using 441 positive place invariants in 209 ms returned sat
[2020-05-27 21:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:07:04] [INFO ] [Nat]Absence check using state equation in 1724 ms returned sat
[2020-05-27 21:07:04] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 72 ms.
[2020-05-27 21:07:20] [INFO ] Added : 698 causal constraints over 142 iterations in 15502 ms. Result :sat
[2020-05-27 21:07:20] [INFO ] [Real]Absence check using 441 positive place invariants in 295 ms returned sat
[2020-05-27 21:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:07:22] [INFO ] [Real]Absence check using state equation in 1836 ms returned sat
[2020-05-27 21:07:22] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 58 ms.
[2020-05-27 21:07:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:07:23] [INFO ] [Nat]Absence check using 441 positive place invariants in 286 ms returned sat
[2020-05-27 21:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:07:25] [INFO ] [Nat]Absence check using state equation in 2136 ms returned sat
[2020-05-27 21:07:25] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 47 ms.
[2020-05-27 21:07:40] [INFO ] Added : 718 causal constraints over 144 iterations in 14908 ms. Result :sat
[2020-05-27 21:07:40] [INFO ] [Real]Absence check using 441 positive place invariants in 278 ms returned sat
[2020-05-27 21:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:07:42] [INFO ] [Real]Absence check using state equation in 1737 ms returned sat
[2020-05-27 21:07:42] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 52 ms.
[2020-05-27 21:07:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:07:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 280 ms returned sat
[2020-05-27 21:07:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:07:45] [INFO ] [Nat]Absence check using state equation in 1754 ms returned sat
[2020-05-27 21:07:45] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 54 ms.
[2020-05-27 21:07:59] [INFO ] Added : 686 causal constraints over 139 iterations in 14526 ms. Result :sat
[2020-05-27 21:08:00] [INFO ] [Real]Absence check using 441 positive place invariants in 277 ms returned sat
[2020-05-27 21:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:01] [INFO ] [Real]Absence check using state equation in 1692 ms returned sat
[2020-05-27 21:08:01] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 52 ms.
[2020-05-27 21:08:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:08:02] [INFO ] [Nat]Absence check using 441 positive place invariants in 246 ms returned sat
[2020-05-27 21:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:04] [INFO ] [Nat]Absence check using state equation in 1779 ms returned sat
[2020-05-27 21:08:04] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 46 ms.
[2020-05-27 21:08:16] [INFO ] Added : 686 causal constraints over 140 iterations in 12405 ms. Result :sat
[2020-05-27 21:08:17] [INFO ] [Real]Absence check using 441 positive place invariants in 236 ms returned sat
[2020-05-27 21:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:18] [INFO ] [Real]Absence check using state equation in 1656 ms returned sat
[2020-05-27 21:08:18] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 38 ms.
[2020-05-27 21:08:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:08:19] [INFO ] [Nat]Absence check using 441 positive place invariants in 274 ms returned sat
[2020-05-27 21:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:21] [INFO ] [Nat]Absence check using state equation in 1687 ms returned sat
[2020-05-27 21:08:21] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 28 ms.
[2020-05-27 21:08:33] [INFO ] Added : 707 causal constraints over 145 iterations in 12660 ms. Result :sat
[2020-05-27 21:08:34] [INFO ] [Real]Absence check using 441 positive place invariants in 292 ms returned sat
[2020-05-27 21:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:36] [INFO ] [Real]Absence check using state equation in 1867 ms returned sat
[2020-05-27 21:08:36] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 43 ms.
[2020-05-27 21:08:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:08:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 272 ms returned sat
[2020-05-27 21:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:38] [INFO ] [Nat]Absence check using state equation in 1633 ms returned sat
[2020-05-27 21:08:38] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 48 ms.
[2020-05-27 21:08:52] [INFO ] Added : 691 causal constraints over 140 iterations in 14062 ms. Result :sat
[2020-05-27 21:08:53] [INFO ] [Real]Absence check using 441 positive place invariants in 293 ms returned sat
[2020-05-27 21:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:54] [INFO ] [Real]Absence check using state equation in 1781 ms returned sat
[2020-05-27 21:08:55] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 55 ms.
[2020-05-27 21:08:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:08:55] [INFO ] [Nat]Absence check using 441 positive place invariants in 286 ms returned sat
[2020-05-27 21:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:08:57] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2020-05-27 21:08:57] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 45 ms.
[2020-05-27 21:09:14] [INFO ] Added : 688 causal constraints over 139 iterations in 17363 ms. Result :unknown
[2020-05-27 21:09:15] [INFO ] [Real]Absence check using 441 positive place invariants in 201 ms returned sat
[2020-05-27 21:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:09:16] [INFO ] [Real]Absence check using state equation in 1577 ms returned sat
[2020-05-27 21:09:16] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 37 ms.
[2020-05-27 21:09:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:09:17] [INFO ] [Nat]Absence check using 441 positive place invariants in 210 ms returned sat
[2020-05-27 21:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:09:18] [INFO ] [Nat]Absence check using state equation in 1603 ms returned sat
[2020-05-27 21:09:18] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 31 ms.
[2020-05-27 21:09:32] [INFO ] Added : 696 causal constraints over 143 iterations in 13988 ms. Result :sat
[2020-05-27 21:09:33] [INFO ] [Real]Absence check using 441 positive place invariants in 325 ms returned sat
[2020-05-27 21:09:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:09:35] [INFO ] [Real]Absence check using state equation in 1790 ms returned sat
[2020-05-27 21:09:35] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 50 ms.
[2020-05-27 21:09:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:09:35] [INFO ] [Nat]Absence check using 441 positive place invariants in 285 ms returned sat
[2020-05-27 21:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:09:37] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2020-05-27 21:09:37] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 51 ms.
[2020-05-27 21:09:50] [INFO ] Added : 709 causal constraints over 143 iterations in 12972 ms. Result :sat
[2020-05-27 21:09:51] [INFO ] [Real]Absence check using 441 positive place invariants in 209 ms returned sat
[2020-05-27 21:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:09:52] [INFO ] [Real]Absence check using state equation in 1679 ms returned sat
[2020-05-27 21:09:52] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 77 ms.
[2020-05-27 21:09:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:09:53] [INFO ] [Nat]Absence check using 441 positive place invariants in 293 ms returned sat
[2020-05-27 21:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:09:55] [INFO ] [Nat]Absence check using state equation in 1634 ms returned sat
[2020-05-27 21:09:55] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 39 ms.
[2020-05-27 21:10:06] [INFO ] Added : 703 causal constraints over 144 iterations in 11073 ms. Result :sat
[2020-05-27 21:10:06] [INFO ] [Real]Absence check using 441 positive place invariants in 262 ms returned sat
[2020-05-27 21:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:08] [INFO ] [Real]Absence check using state equation in 1902 ms returned sat
[2020-05-27 21:10:08] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 39 ms.
[2020-05-27 21:10:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:10:09] [INFO ] [Nat]Absence check using 441 positive place invariants in 278 ms returned sat
[2020-05-27 21:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:10] [INFO ] [Nat]Absence check using state equation in 1582 ms returned sat
[2020-05-27 21:10:10] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 54 ms.
[2020-05-27 21:10:23] [INFO ] Added : 707 causal constraints over 144 iterations in 12396 ms. Result :sat
[2020-05-27 21:10:23] [INFO ] [Real]Absence check using 441 positive place invariants in 232 ms returned sat
[2020-05-27 21:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:25] [INFO ] [Real]Absence check using state equation in 1793 ms returned sat
[2020-05-27 21:10:25] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 38 ms.
[2020-05-27 21:10:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:10:26] [INFO ] [Nat]Absence check using 441 positive place invariants in 282 ms returned sat
[2020-05-27 21:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:27] [INFO ] [Nat]Absence check using state equation in 1739 ms returned sat
[2020-05-27 21:10:28] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 37 ms.
[2020-05-27 21:10:41] [INFO ] Added : 708 causal constraints over 143 iterations in 13422 ms. Result :sat
[2020-05-27 21:10:41] [INFO ] [Real]Absence check using 441 positive place invariants in 231 ms returned sat
[2020-05-27 21:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:43] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2020-05-27 21:10:43] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 40 ms.
[2020-05-27 21:10:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:10:44] [INFO ] [Nat]Absence check using 441 positive place invariants in 272 ms returned sat
[2020-05-27 21:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:46] [INFO ] [Nat]Absence check using state equation in 1822 ms returned sat
[2020-05-27 21:10:46] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 30 ms.
[2020-05-27 21:10:57] [INFO ] Added : 704 causal constraints over 144 iterations in 11083 ms. Result :sat
[2020-05-27 21:10:57] [INFO ] [Real]Absence check using 441 positive place invariants in 196 ms returned sat
[2020-05-27 21:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:10:59] [INFO ] [Real]Absence check using state equation in 1608 ms returned sat
[2020-05-27 21:10:59] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 29 ms.
[2020-05-27 21:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:10:59] [INFO ] [Nat]Absence check using 441 positive place invariants in 191 ms returned sat
[2020-05-27 21:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:11:01] [INFO ] [Nat]Absence check using state equation in 1467 ms returned sat
[2020-05-27 21:11:01] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 28 ms.
[2020-05-27 21:11:12] [INFO ] Added : 708 causal constraints over 143 iterations in 11059 ms. Result :sat
[2020-05-27 21:11:12] [INFO ] [Real]Absence check using 441 positive place invariants in 288 ms returned sat
[2020-05-27 21:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:11:14] [INFO ] [Real]Absence check using state equation in 1800 ms returned sat
[2020-05-27 21:11:14] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 41 ms.
[2020-05-27 21:11:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:11:15] [INFO ] [Nat]Absence check using 441 positive place invariants in 214 ms returned sat
[2020-05-27 21:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:11:16] [INFO ] [Nat]Absence check using state equation in 1706 ms returned sat
[2020-05-27 21:11:16] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 55 ms.
[2020-05-27 21:11:30] [INFO ] Added : 715 causal constraints over 145 iterations in 13471 ms. Result :sat
[2020-05-27 21:11:30] [INFO ] [Real]Absence check using 441 positive place invariants in 280 ms returned sat
[2020-05-27 21:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:11:32] [INFO ] [Real]Absence check using state equation in 1869 ms returned sat
[2020-05-27 21:11:32] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 48 ms.
[2020-05-27 21:11:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:11:33] [INFO ] [Nat]Absence check using 441 positive place invariants in 216 ms returned sat
[2020-05-27 21:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:11:35] [INFO ] [Nat]Absence check using state equation in 1896 ms returned sat
[2020-05-27 21:11:35] [INFO ] Computed and/alt/rep : 721/2239/721 causal constraints in 27 ms.
[2020-05-27 21:11:48] [INFO ] Added : 715 causal constraints over 145 iterations in 13396 ms. Result :sat
[2020-05-27 21:11:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 21:11:49] [INFO ] Flatten gal took : 274 ms
FORMULA ShieldPPPt-PT-040A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 21:11:49] [INFO ] Flatten gal took : 93 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 21:11:49] [INFO ] Applying decomposition
[2020-05-27 21:11:49] [INFO ] Flatten gal took : 126 ms
[2020-05-27 21:11:49] [INFO ] Input system was already deterministic with 722 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11498035322220081686.txt, -o, /tmp/graph11498035322220081686.bin, -w, /tmp/graph11498035322220081686.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11498035322220081686.bin, -l, -1, -v, -w, /tmp/graph11498035322220081686.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 21:11:50] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 722 rows 1003 cols
[2020-05-27 21:11:50] [INFO ] Computed 441 place invariants in 11 ms
inv : p0 + p622 + p623 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p710 + p713 + p714 = 1
inv : p0 + p185 + p186 + p187 = 1
inv : p0 + p935 + p936 + p937 = 1
inv : p0 + p335 + p338 + p339 = 1
inv : p0 + p597 + p598 = 1
inv : p0 + p560 + p561 + p562 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p565 + p566 + p567 = 1
inv : p0 + p547 + p548 = 1
inv : p0 + p715 + p718 + p719 = 1
inv : p0 + p555 + p556 + p557 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p155 + p158 + p159 = 1
inv : p0 + p330 + p333 + p334 = 1
inv : p0 + p180 + p181 + p182 = 1
inv : p0 + p522 + p523 = 1
inv : p0 + p905 + p908 + p909 = 1
inv : p0 + p930 + p931 + p932 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p190 + p191 + p192 = 1
inv : p0 + p672 + p673 = 1
inv : p0 + p515 + p518 + p519 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p647 + p648 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p530 + p533 + p534 = 1
inv : p0 + p797 + p798 = 1
inv : p0 + p910 + p913 + p914 = 1
inv : p0 + p160 + p163 + p164 = 1
inv : p0 + p535 + p538 + p539 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p422 + p423 = 1
inv : p0 + p847 + p848 = 1
inv : p0 + p472 + p473 = 1
inv : p0 + p772 + p773 = 1
inv : p0 + p890 + p893 + p894 = 1
inv : p0 + p999 + p1000 = 1
inv : p0 + p755 + p756 + p757 = 1
inv : p0 + p740 + p741 + p742 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p897 + p898 = 1
inv : p0 + p380 + p381 + p382 = 1
inv : p0 + p949 + p950 = 1
inv : p0 + p355 + p358 + p359 = 1
inv : p0 + p505 + p508 + p509 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p365 + p366 + p367 = 1
inv : p0 + p340 + p343 + p344 = 1
inv : p0 + p130 + p133 + p134 = 1
inv : p0 + p722 + p723 = 1
inv : p0 + p70 + p71 = 1
inv : p0 + p735 + p738 + p739 = 1
inv : p0 + p997 + p998 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p445 + p446 = 1
inv : p0 + p535 + p536 + p537 = 1
inv : p0 + p315 + p318 + p319 = 1
inv : p0 + p580 + p581 + p582 = 1
inv : p0 + p360 + p363 + p364 = 1
inv : p0 + p355 + p356 + p357 = 1
inv : p0 + p165 + p168 + p169 = 1
inv : p0 + p922 + p923 = 1
inv : p0 + p724 + p725 = 1
inv : p0 + p180 + p183 + p184 = 1
inv : p0 + p205 + p206 + p207 = 1
inv : p0 + p160 + p161 + p162 = 1
inv : p0 + p899 + p900 = 1
inv : p0 + p270 + p271 = 1
inv : p0 + p874 + p875 = 1
inv : p0 + p222 + p223 = 1
inv : p0 + p420 + p421 = 1
inv : p0 + p385 + p386 + p387 = 1
inv : p0 + p760 + p761 + p762 = 1
inv : p0 + p822 + p823 = 1
inv : p0 + p624 + p625 = 1
inv : p0 + p72 + p73 = 1
inv : p0 + p135 + p138 + p139 = 1
inv : p0 + p715 + p716 + p717 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p555 + p558 + p559 = 1
inv : p0 + p520 + p521 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p340 + p341 + p342 = 1
inv : p0 + p510 + p513 + p514 = 1
inv : p0 + p595 + p596 = 1
inv : p0 + p705 + p708 + p709 = 1
inv : p0 + p540 + p543 + p544 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p790 + p791 + p792 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p747 + p748 = 1
inv : p0 + p549 + p550 = 1
inv : p0 + p730 + p731 + p732 = 1
inv : p0 + p974 + p975 = 1
inv : p0 + p930 + p933 + p934 = 1
inv : p0 + p572 + p573 = 1
inv : p0 + p799 + p800 = 1
inv : p0 + p690 + p693 + p694 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p910 + p911 + p912 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p955 + p956 + p957 = 1
inv : p0 + p855 + p858 + p859 = 1
inv : p0 + p915 + p918 + p919 = 1
inv : p0 + p940 + p941 + p942 = 1
inv : p0 + p885 + p888 + p889 = 1
inv : p0 + p474 + p475 = 1
inv : p0 + p770 + p771 = 1
inv : p0 + p665 + p668 + p669 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p795 + p796 = 1
inv : p0 + p515 + p516 + p517 = 1
inv : p0 + p449 + p450 = 1
inv : p0 + p235 + p236 + p237 = 1
inv : p0 + p330 + p331 + p332 = 1
inv : p0 + p605 + p606 + p607 = 1
inv : p0 + p760 + p763 + p764 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p415 + p416 + p417 = 1
inv : p0 + p870 + p871 = 1
inv : p0 + p240 + p241 + p242 = 1
inv : p0 + p940 + p943 + p944 = 1
inv : p0 + p720 + p721 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p485 + p488 + p489 = 1
inv : p0 + p755 + p758 + p759 = 1
inv : p0 + p510 + p511 + p512 = 1
inv : p0 + p599 + p600 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p845 + p846 = 1
inv : p0 + p78 + p79 = 1
inv : p0 + p976 + p977 = 1
inv : p0 + p690 + p691 + p692 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p570 + p571 = 1
inv : p0 + p490 + p493 + p494 = 1
inv : p0 + p35 + p36 + p37 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p990 + p991 + p992 = 1
inv : p0 + p580 + p583 + p584 = 1
inv : p0 + p935 + p938 + p939 = 1
inv : p0 + p785 + p786 + p787 = 1
inv : p0 + p495 + p496 = 1
inv : p0 + p190 + p193 + p194 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p215 + p216 + p217 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p65 + p66 + p67 = 1
inv : p0 + p460 + p463 + p464 = 1
inv : p0 + p310 + p313 + p314 = 1
inv : p0 + p280 + p283 + p284 = 1
inv : p0 + p751 + p752 = 1
inv : p0 + p155 + p156 + p157 = 1
inv : p0 + p524 + p525 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p920 + p921 = 1
inv : p0 + p335 + p336 + p337 = 1
inv : p0 + p305 + p306 + p307 = 1
inv : p0 + p210 + p211 + p212 = 1
inv : p0 + p640 + p643 + p644 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p824 + p825 = 1
inv : p0 + p960 + p961 + p962 = 1
inv : p0 + p370 + p371 = 1
inv : p0 + p553 + p554 = 1
inv : p0 + p35 + p38 + p39 = 1
inv : p0 + p965 + p968 + p969 = 1
inv : p0 + p730 + p733 + p734 = 1
inv : p0 + p815 + p816 + p817 = 1
inv : p0 + p635 + p638 + p639 = 1
inv : p0 + p880 + p883 + p884 = 1
inv : p0 + p365 + p368 + p369 = 1
inv : p0 + p749 + p750 = 1
inv : p0 + p965 + p966 + p967 = 1
inv : p0 + p905 + p906 + p907 = 1
inv : p0 + p215 + p218 + p219 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p628 + p629 = 1
inv : p0 + p390 + p391 + p392 = 1
inv : p0 + p785 + p788 + p789 = 1
inv : p0 + p305 + p308 + p309 = 1
inv : p0 + p780 + p781 + p782 = 1
inv : p0 + p947 + p948 = 1
inv : p0 + p540 + p541 + p542 = 1
inv : p0 + p810 + p811 + p812 = 1
inv : p0 + p455 + p458 + p459 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p995 + p996 = 1
inv : p0 + p826 + p827 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p551 + p552 = 1
inv : p0 + p372 + p373 = 1
inv : p0 + p630 + p631 + p632 = 1
inv : p0 + p447 + p448 = 1
inv : p0 + p220 + p221 = 1
inv : p0 + p185 + p188 + p189 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p360 + p361 + p362 = 1
inv : p0 + p60 + p61 + p62 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p65 + p68 + p69 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p476 + p477 = 1
inv : p0 + p645 + p646 = 1
inv : p0 + p703 + p704 = 1
inv : p0 + p872 + p873 = 1
inv : p0 + p901 + p902 = 1
inv : p0 + p249 + p250 = 1
inv : p0 + p674 + p675 = 1
inv : p0 + p326 + p327 = 1
inv : p0 + p430 + p433 + p434 = 1
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p280 + p281 + p282 = 1
inv : p0 + p655 + p656 + p657 = 1
inv : p0 + p805 + p808 + p809 = 1
inv : p0 + p351 + p352 = 1
inv : p0 + p840 + p841 + p842 = 1
inv : p0 + p903 + p904 = 1
inv : p0 + p615 + p618 + p619 = 1
inv : p0 + p90 + p91 + p92 = 1
inv : p0 + p878 + p879 = 1
inv : p0 + p953 + p954 = 1
inv : p0 + p240 + p243 + p244 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p435 + p438 + p439 = 1
inv : p0 + p376 + p377 = 1
inv : p0 + p660 + p661 + p662 = 1
inv : p0 + p285 + p286 + p287 = 1
inv : p0 + p401 + p402 = 1
inv : p0 + p803 + p804 = 1
inv : p0 + p60 + p63 + p64 = 1
inv : p0 + p985 + p988 + p989 = 1
inv : p0 + p426 + p427 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p778 + p779 = 1
inv : p0 + p276 + p277 = 1
inv : p0 + p465 + p466 + p467 = 1
inv : p0 + p85 + p86 + p87 = 1
inv : p0 + p440 + p443 + p444 = 1
inv : p0 + p928 + p929 = 1
inv : p0 + p830 + p831 + p832 = 1
inv : p0 + p605 + p608 + p609 = 1
inv : p0 + p728 + p729 = 1
inv : p0 + p980 + p983 + p984 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p455 + p456 + p457 = 1
inv : p0 + p665 + p666 + p667 = 1
inv : p0 + p855 + p856 + p857 = 1
inv : p0 + p80 + p81 + p82 = 1
inv : p0 + p501 + p502 = 1
inv : p0 + p815 + p818 + p819 = 1
inv : p0 + p790 + p793 + p794 = 1
inv : p0 + p451 + p452 = 1
inv : p0 + p678 + p679 = 1
inv : p0 + p110 + p111 + p112 = 1
inv : p0 + p485 + p486 + p487 = 1
inv : p0 + p610 + p613 + p614 = 1
inv : p0 + p635 + p636 + p637 = 1
inv : p0 + p76 + p77 = 1
inv : p0 + p978 + p979 = 1
inv : p0 + p415 + p418 + p419 = 1
inv : p0 + p40 + p43 + p44 = 1
inv : p0 + p626 + p627 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p265 + p268 + p269 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p260 + p261 + p262 = 1
inv : p0 + p853 + p854 = 1
inv : p0 + p235 + p238 + p239 = 1
inv : p0 + p865 + p866 + p867 = 1
inv : p0 + p780 + p783 + p784 = 1
inv : p0 + p115 + p116 + p117 = 1
inv : p0 + p701 + p702 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p676 + p677 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p405 + p408 + p409 = 1
inv : p0 + p490 + p491 + p492 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p653 + p654 = 1
inv : p0 + p310 + p311 + p312 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p503 + p504 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p465 + p468 + p469 = 1
inv : p0 + p90 + p93 + p94 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p255 + p258 + p259 = 1
inv : p0 + p945 + p946 = 1
inv : p0 + p526 + p527 = 1
inv : p0 + p805 + p806 + p807 = 1
inv : p0 + p851 + p852 = 1
inv : p0 + p630 + p633 + p634 = 1
inv : p0 + p585 + p588 + p589 = 1
inv : p0 + p505 + p506 + p507 = 1
inv : p0 + p210 + p213 + p214 = 1
inv : p0 + p265 + p266 + p267 = 1
inv : p0 + p640 + p641 + p642 = 1
inv : p0 + p176 + p177 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p753 + p754 = 1
inv : p0 + p328 + p329 = 1
inv : p0 + p430 + p431 + p432 = 1
inv : p0 + p460 + p461 + p462 = 1
inv : p0 + p390 + p393 + p394 = 1
inv : p0 + p810 + p813 + p814 = 1
inv : p0 + p601 + p602 = 1
inv : p0 + p776 + p777 = 1
inv : p0 + p835 + p836 + p837 = 1
inv : p0 + p828 + p829 = 1
inv : p0 + p685 + p686 + p687 = 1
inv : p0 + p660 + p663 + p664 = 1
inv : p0 + p374 + p375 = 1
inv : p0 + p985 + p986 + p987 = 1
inv : p0 + p880 + p881 + p882 = 1
inv : p0 + p960 + p963 + p964 = 1
inv : p0 + p765 + p768 + p769 = 1
inv : p0 + p990 + p993 + p994 = 1
inv : p0 + p578 + p579 = 1
inv : p0 + p840 + p843 + p844 = 1
inv : p0 + p178 + p179 = 1
inv : p0 + p140 + p141 + p142 = 1
inv : p0 + p980 + p981 + p982 = 1
inv : p0 + p290 + p293 + p294 = 1
inv : p0 + p424 + p425 = 1
inv : p0 + p820 + p821 = 1
inv : p0 + p1001 + p1002 = 1
inv : p0 + p610 + p611 + p612 = 1
inv : p0 + p285 + p288 + p289 = 1
inv : p0 + p745 + p746 = 1
inv : p0 + p499 + p500 = 1
inv : p0 + p890 + p891 + p892 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p135 + p136 + p137 = 1
inv : p0 + p40 + p41 + p42 = 1
inv : p0 + p574 + p575 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p695 + p696 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p951 + p952 = 1
inv : p0 + p885 + p886 + p887 = 1
inv : p0 + p380 + p383 + p384 = 1
inv : p0 + p105 + p108 + p109 = 1
inv : p0 + p130 + p131 + p132 = 1
inv : p0 + p228 + p229 = 1
inv : p0 + p560 + p563 + p564 = 1
inv : p0 + p615 + p616 + p617 = 1
inv : p0 + p705 + p706 + p707 = 1
inv : p0 + p876 + p877 = 1
inv : p0 + p274 + p275 = 1
inv : p0 + p649 + p650 = 1
inv : p0 + p115 + p118 + p119 = 1
inv : p0 + p955 + p958 + p959 = 1
inv : p0 + p620 + p621 = 1
inv : p0 + p970 + p971 = 1
inv : p0 + p545 + p546 = 1
inv : p0 + p378 + p379 = 1
inv : p0 + p710 + p711 + p712 = 1
inv : p0 + p926 + p927 = 1
inv : p0 + p655 + p658 + p659 = 1
inv : p0 + p860 + p863 + p864 = 1
inv : p0 + p865 + p868 + p869 = 1
inv : p0 + p349 + p350 = 1
inv : p0 + p699 + p700 = 1
inv : p0 + p224 + p225 = 1
inv : p0 + p835 + p838 + p839 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p122 + p123 = 1
inv : p0 + p801 + p802 = 1
inv : p0 + p670 + p671 = 1
inv : p0 + p590 + p591 + p592 = 1
inv : p0 + p565 + p568 + p569 = 1
inv : p0 + p85 + p88 + p89 = 1
inv : p0 + p530 + p531 + p532 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p230 + p231 + p232 = 1
inv : p0 + p440 + p441 + p442 = 1
inv : p0 + p385 + p388 + p389 = 1
inv : p0 + p410 + p411 + p412 = 1
inv : p0 + p205 + p208 + p209 = 1
inv : p0 + p395 + p396 = 1
inv : p0 + p528 + p529 = 1
inv : p0 + p830 + p833 + p834 = 1
inv : p0 + p651 + p652 = 1
inv : p0 + p915 + p916 + p917 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p603 + p604 = 1
inv : p0 + p680 + p681 + p682 = 1
inv : p0 + p255 + p256 + p257 = 1
inv : p0 + p774 + p775 = 1
inv : p0 + p80 + p83 + p84 = 1
inv : p0 + p272 + p273 = 1
inv : p0 + p860 + p861 + p862 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p924 + p925 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p726 + p727 = 1
inv : p0 + p165 + p166 + p167 = 1
inv : p0 + p685 + p688 + p689 = 1
inv : p0 + p849 + p850 = 1
inv : p0 + p74 + p75 = 1
inv : p0 + p972 + p973 = 1
inv : p0 + p260 + p263 + p264 = 1
inv : p0 + p347 + p348 = 1
inv : p0 + p740 + p743 + p744 = 1
inv : p0 + p765 + p766 + p767 = 1
inv : p0 + p680 + p683 + p684 = 1
inv : p0 + p576 + p577 = 1
inv : p0 + p405 + p406 + p407 = 1
inv : p0 + p435 + p436 + p437 = 1
inv : p0 + p410 + p413 + p414 = 1
inv : p0 + p735 + p736 + p737 = 1
inv : p0 + p590 + p593 + p594 = 1
inv : p0 + p585 + p586 + p587 = 1
inv : p0 + p315 + p316 + p317 = 1
inv : p0 + p230 + p233 + p234 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p140 + p143 + p144 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p110 + p113 + p114 = 1
inv : p0 + p105 + p106 + p107 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p697 + p698 = 1
inv : p0 + p226 + p227 = 1
inv : p0 + p470 + p471 = 1
inv : p0 + p895 + p896 = 1
Total of 441 invariants.
[2020-05-27 21:11:50] [INFO ] Computed 441 place invariants in 37 ms
[2020-05-27 21:11:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 21:11:50] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-27 21:11:50] [INFO ] Flatten gal took : 165 ms
[2020-05-27 21:11:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 153 ms.
[2020-05-27 21:11:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 41 ms
[2020-05-27 21:11:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !(((!(F("((i21.u315.p987==1)&&(i21.u315.p989==1))")))||((!(X(F("((i9.i2.i1.u156.p492==1)&&(i9.i2.i1.u156.p494==1))"))))&&(F(X("((i0.i0.i3.u4.p18==1)&&(i0.i0.i2.u7.p25==1))"))))))
Formula 0 simplified : !(!F"((i21.u315.p987==1)&&(i21.u315.p989==1))" | (!XF"((i9.i2.i1.u156.p492==1)&&(i9.i2.i1.u156.p494==1))" & FX"((i0.i0.i3.u4.p18==1)&&(i0.i0.i2.u7.p25==1))"))
built 25 ordering constraints for composite.
built 21 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 31 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 26 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 25 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 24 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 34 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 22 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 25 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 25 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 24 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
[2020-05-27 21:11:56] [INFO ] Proved 1003 variables to be positive in 5711 ms
[2020-05-27 21:11:56] [INFO ] Computing symmetric may disable matrix : 722 transitions.
[2020-05-27 21:11:56] [INFO ] Computation of disable matrix completed :0/722 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 21:11:56] [INFO ] Computation of Complete disable matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 21:11:56] [INFO ] Computing symmetric may enable matrix : 722 transitions.
[2020-05-27 21:11:56] [INFO ] Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 21:11:57] [INFO ] Built C files in 8094ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 8304 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 82 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( <>((LTLAP0==true))) ) || ( ( !( X(<>((LTLAP1==true)))) ) && ( <>(X((LTLAP2==true))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( <>((LTLAP0==true))) ) || ( ( !( X(<>((LTLAP1==true)))) ) && ( <>(X((LTLAP2==true))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( <>((LTLAP0==true))) ) || ( ( !( X(<>((LTLAP1==true)))) ) && ( <>(X((LTLAP2==true))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-27 21:34:27] [INFO ] Applying decomposition
[2020-05-27 21:34:28] [INFO ] Flatten gal took : 227 ms
[2020-05-27 21:34:28] [INFO ] Decomposing Gal with order
[2020-05-27 21:34:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 21:34:28] [INFO ] Removed a total of 240 redundant transitions.
[2020-05-27 21:34:28] [INFO ] Flatten gal took : 154 ms
[2020-05-27 21:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2020-05-27 21:34:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 156 ms
[2020-05-27 21:34:28] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 14 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !(((!(F("((i315.u553.p987==1)&&(i315.u554.p989==1))")))||((!(X(F("((i156.u276.p492==1)&&(i156.u277.p494==1))"))))&&(F(X("((i4.u11.p18==1)&&(u14.p25==1))"))))))
Formula 0 simplified : !(!F"((i315.u553.p987==1)&&(i315.u554.p989==1))" | (!XF"((i156.u276.p492==1)&&(i156.u277.p494==1))" & FX"((i4.u11.p18==1)&&(u14.p25==1))"))
built 441 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5858 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,58.702,1070584,1,0,2.39147e+06,1101,10085,3.78652e+06,44,842,3354239
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(("(u196.p349==1)")U(!(X(G(("(((i306.u537.p958==1)&&(u546.p975==1))||((i250.u596.p780==1)&&(u447.p797==1)))")U("(((i306.u537.p958==1)&&(u546.p975==1))&&(u196.p349==1))"))))))))))
Formula 1 simplified : !GXX("(u196.p349==1)" U !XG("(((i306.u537.p958==1)&&(u546.p975==1))||((i250.u596.p780==1)&&(u447.p797==1)))" U "(((i306.u537.p958==1)&&(u546.p975==1))&&(u196.p349==1))"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
3295 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,91.6649,1680576,1,0,3.73652e+06,1101,10923,5.85274e+06,45,842,7346732
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(((G((X("((u520.p928==1)&&(u533.p951==1))"))U("((i252.u591.p790==1)&&(u462.p824==1))")))||(X("((u450.p804==1)&&(u461.p823==1))")))U("((u450.p804==1)&&(u461.p823==1))"))))
Formula 2 simplified : !G((G(X"((u520.p928==1)&&(u533.p951==1))" U "((i252.u591.p790==1)&&(u462.p824==1))") | X"((u450.p804==1)&&(u461.p823==1))") U "((u450.p804==1)&&(u461.p823==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,91.8924,1687064,1,0,3.74006e+06,1101,11243,5.85719e+06,45,842,7351411
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(((X(F("((i10.u18.p31==1)&&(u26.p46==1))")))||(F(!(G(X("((i155.u273.p487==1)&&(i155.u274.p489==1))"))))))U("((i44.u80.p142==1)&&(i44.u81.p144==1))")))))
Formula 3 simplified : G((XF"((i10.u18.p31==1)&&(u26.p46==1))" | F!GX"((i155.u273.p487==1)&&(i155.u274.p489==1))") U "((i44.u80.p142==1)&&(i44.u81.p144==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1958 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,111.473,2117060,1,0,4.75593e+06,1101,12864,7.2549e+06,45,842,9290839
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((G(X(F(!(F((F("((i147.u260.p463==1)&&(u267.p477==1))"))||("((i147.u260.p463==1)&&(u267.p477==1))")))))))||("((i260.u614.p815==1)&&(u476.p849==1))"))))
Formula 4 simplified : !G("((i260.u614.p815==1)&&(u476.p849==1))" | GXF!F("((i147.u260.p463==1)&&(u267.p477==1))" | F"((i147.u260.p463==1)&&(u267.p477==1))"))
4 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
233 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,113.853,2198884,1,0,4.95322e+06,1101,13262,7.50853e+06,45,842,9667072
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F((F("((i82.u144.p256==1)&&(u152.p271==1))"))U("((((i82.u144.p256==1)&&(u152.p271==1))&&(i91.u161.p287==1))&&(i91.u162.p289==1))")))&&(!(F("((i258.u452.p807==1)&&(i258.u453.p809==1))")))))
Formula 5 simplified : !(F(F"((i82.u144.p256==1)&&(u152.p271==1))" U "((((i82.u144.p256==1)&&(u152.p271==1))&&(i91.u161.p287==1))&&(i91.u162.p289==1))") & !F"((i258.u452.p807==1)&&(i258.u453.p809==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2608 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,139.93,2391488,1,0,5.39991e+06,1101,6835,8.1719e+06,35,842,40630
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G(!((!(G(F("(u677.p0==1)"))))U(X(F("((i274.u480.p856==1)&&(u488.p871==1))"))))))||("((i170.u663.p530==1)&&(u307.p547==1))"))))
Formula 6 simplified : !X("((i170.u663.p530==1)&&(u307.p547==1))" | G!(!GF"(u677.p0==1)" U XF"((i274.u480.p856==1)&&(u488.p871==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1871 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,158.649,2391488,1,0,5.39991e+06,1101,8393,8.1719e+06,37,842,4695806
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X("((i282.u622.p880==1)&&(u503.p897==1))"))U("((i34.u61.p108==1)&&(u70.p125==1))")))
Formula 7 simplified : !(X"((i282.u622.p880==1)&&(u503.p897==1))" U "((i34.u61.p108==1)&&(u70.p125==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,158.9,2391488,1,0,5.39991e+06,1101,8413,8.1719e+06,37,842,4754209
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(G(X("((i92.u165.p293==1)&&(u168.p300==1))"))))))
Formula 8 simplified : XGX"((i92.u165.p293==1)&&(u168.p300==1))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,158.91,2391488,1,0,5.39991e+06,1101,8439,8.1719e+06,37,842,4754452
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-040A-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(X(G("(u251.p447==1)"))))||((!(F("((i138.u635.p430==1)&&(u251.p447==1))")))U(G(!(G(F("((i259.u456.p813==1)&&(u463.p827==1))"))))))))
Formula 9 simplified : !(XXG"(u251.p447==1)" | (!F"((i138.u635.p430==1)&&(u251.p447==1))" U G!GF"((i259.u456.p813==1)&&(u463.p827==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
164 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,160.552,2391488,1,0,5.39991e+06,1101,8595,8.1719e+06,38,842,5064227
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(F(G((F(G("(u55.p97==1)")))U(F("(u55.p97==1)"))))))))
Formula 10 simplified : !FXFG(FG"(u55.p97==1)" U F"(u55.p97==1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
25 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,160.814,2391488,1,0,5.39991e+06,1101,9144,8.1719e+06,38,842,5073260
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(X(((!(F("(u43.p76==1)")))||("(u43.p76==1)"))||((X("((i4.u680.p15==1)&&(u28.p49==1))"))&&(G("((i122.u215.p383==1)&&(u224.p400==1))"))))))U("((i4.u680.p15==1)&&(u28.p49==1))")))
Formula 11 simplified : !(GX("(u43.p76==1)" | !F"(u43.p76==1)" | (X"((i4.u680.p15==1)&&(u28.p49==1))" & G"((i122.u215.p383==1)&&(u224.p400==1))")) U "((i4.u680.p15==1)&&(u28.p49==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2022 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,181.037,2391488,1,0,5.39991e+06,1101,9807,8.1719e+06,38,842,8858268
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(("((u30.p53!=1)||(u43.p76!=1))")U("((i186.u326.p581!=1)||(u334.p596!=1))")))&&((F((X("((u506.p904==1)&&(u517.p923==1))"))U("((u506.p904==1)&&(u517.p923==1))")))||(G("((i186.u326.p581==1)&&(u334.p596==1))")))))
Formula 12 simplified : !(X("((u30.p53!=1)||(u43.p76!=1))" U "((i186.u326.p581!=1)||(u334.p596!=1))") & (F(X"((u506.p904==1)&&(u517.p923==1))" U "((u506.p904==1)&&(u517.p923==1))") | G"((i186.u326.p581==1)&&(u334.p596==1))"))
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,181.28,2391488,1,0,5.39991e+06,1101,9951,8.1719e+06,39,842,8893853
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590615467952

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldPPPt-PT-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-040A, 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 r210-tajo-159033476100698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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