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.r051-ebro-158902545900274.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 DES-PT-30a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 70K 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 DES-PT-30a-00
FORMULA_NAME DES-PT-30a-01
FORMULA_NAME DES-PT-30a-02
FORMULA_NAME DES-PT-30a-03
FORMULA_NAME DES-PT-30a-04
FORMULA_NAME DES-PT-30a-05
FORMULA_NAME DES-PT-30a-06
FORMULA_NAME DES-PT-30a-07
FORMULA_NAME DES-PT-30a-08
FORMULA_NAME DES-PT-30a-09
FORMULA_NAME DES-PT-30a-10
FORMULA_NAME DES-PT-30a-11
FORMULA_NAME DES-PT-30a-12
FORMULA_NAME DES-PT-30a-13
FORMULA_NAME DES-PT-30a-14
FORMULA_NAME DES-PT-30a-15

=== Now, execution of the tool begins

BK_START 1589543299261

[2020-05-15 11:48:22] [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-15 11:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 11:48:22] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2020-05-15 11:48:22] [INFO ] Transformed 234 places.
[2020-05-15 11:48:22] [INFO ] Transformed 191 transitions.
[2020-05-15 11:48:22] [INFO ] Found NUPN structural information;
[2020-05-15 11:48:22] [INFO ] Parsed PT model containing 234 places and 191 transitions in 204 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2216 resets, run finished after 768 ms. (steps per millisecond=130 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0]
// Phase 1: matrix 177 rows 234 cols
[2020-05-15 11:48:23] [INFO ] Computed 59 place invariants in 34 ms
[2020-05-15 11:48:23] [INFO ] [Real]Absence check using 34 positive place invariants in 69 ms returned sat
[2020-05-15 11:48:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 11:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:24] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-05-15 11:48:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 85 ms returned sat
[2020-05-15 11:48:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 104 ms returned sat
[2020-05-15 11:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:25] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2020-05-15 11:48:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 11:48:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 11:48:25] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 38 ms.
[2020-05-15 11:48:27] [INFO ] Added : 141 causal constraints over 29 iterations in 1632 ms. Result :sat
[2020-05-15 11:48:27] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-05-15 11:48:27] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-15 11:48:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2020-05-15 11:48:27] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 11:48:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 11:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:28] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2020-05-15 11:48:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 11:48:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 67 ms returned sat
[2020-05-15 11:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:28] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2020-05-15 11:48:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:48:28] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 38 ms.
[2020-05-15 11:48:30] [INFO ] Added : 154 causal constraints over 31 iterations in 1433 ms. Result :sat
[2020-05-15 11:48:30] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2020-05-15 11:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2020-05-15 11:48:30] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 11:48:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 11:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:31] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2020-05-15 11:48:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 11:48:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 64 ms returned sat
[2020-05-15 11:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:32] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2020-05-15 11:48:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 11:48:32] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 26 ms.
[2020-05-15 11:48:33] [INFO ] Added : 112 causal constraints over 23 iterations in 1097 ms. Result :sat
[2020-05-15 11:48:33] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 11:48:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2020-05-15 11:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:33] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2020-05-15 11:48:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 11:48:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 127 ms returned sat
[2020-05-15 11:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:34] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2020-05-15 11:48:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:48:34] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-05-15 11:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-05-15 11:48:34] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 28 ms.
[2020-05-15 11:48:35] [INFO ] Added : 138 causal constraints over 28 iterations in 1233 ms. Result :sat
[2020-05-15 11:48:36] [INFO ] Deduced a trap composed of 19 places in 119 ms
[2020-05-15 11:48:36] [INFO ] Deduced a trap composed of 18 places in 89 ms
[2020-05-15 11:48:36] [INFO ] Deduced a trap composed of 19 places in 114 ms
[2020-05-15 11:48:36] [INFO ] Deduced a trap composed of 10 places in 82 ms
[2020-05-15 11:48:36] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-05-15 11:48:36] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-05-15 11:48:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 970 ms
[2020-05-15 11:48:36] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 11:48:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 11:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:37] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2020-05-15 11:48:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 11:48:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 62 ms returned sat
[2020-05-15 11:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:38] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2020-05-15 11:48:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 11:48:38] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 33 ms.
[2020-05-15 11:48:39] [INFO ] Added : 139 causal constraints over 29 iterations in 1265 ms. Result :sat
[2020-05-15 11:48:39] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 11:48:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2020-05-15 11:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:39] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2020-05-15 11:48:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 11:48:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 96 ms returned sat
[2020-05-15 11:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:40] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-05-15 11:48:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 11:48:40] [INFO ] Deduced a trap composed of 9 places in 220 ms
[2020-05-15 11:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2020-05-15 11:48:40] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 26 ms.
[2020-05-15 11:48:42] [INFO ] Added : 141 causal constraints over 29 iterations in 1333 ms. Result :sat
[2020-05-15 11:48:42] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-05-15 11:48:42] [INFO ] Deduced a trap composed of 17 places in 54 ms
[2020-05-15 11:48:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2020-05-15 11:48:42] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 11:48:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2020-05-15 11:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:42] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2020-05-15 11:48:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 11:48:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 71 ms returned sat
[2020-05-15 11:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:43] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2020-05-15 11:48:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:48:43] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 26 ms.
[2020-05-15 11:48:44] [INFO ] Added : 158 causal constraints over 32 iterations in 1291 ms. Result :sat
[2020-05-15 11:48:45] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 11:48:45] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 11:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:45] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2020-05-15 11:48:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 11:48:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 11:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:46] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2020-05-15 11:48:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:48:46] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 32 ms.
[2020-05-15 11:48:47] [INFO ] Added : 153 causal constraints over 32 iterations in 1454 ms. Result :sat
[2020-05-15 11:48:47] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 11:48:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 11:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:47] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2020-05-15 11:48:47] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 11:48:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 11:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:48] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-05-15 11:48:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 11:48:48] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 66 ms returned sat
[2020-05-15 11:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:49] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2020-05-15 11:48:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 11:48:49] [INFO ] Deduced a trap composed of 16 places in 113 ms
[2020-05-15 11:48:49] [INFO ] Deduced a trap composed of 13 places in 97 ms
[2020-05-15 11:48:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2020-05-15 11:48:49] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 18 ms.
[2020-05-15 11:48:50] [INFO ] Added : 108 causal constraints over 22 iterations in 1355 ms. Result :sat
[2020-05-15 11:48:50] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 11:48:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2020-05-15 11:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:51] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2020-05-15 11:48:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 11:48:51] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 62 ms returned sat
[2020-05-15 11:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:52] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2020-05-15 11:48:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 11:48:52] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 20 ms.
[2020-05-15 11:48:53] [INFO ] Added : 131 causal constraints over 27 iterations in 1350 ms. Result :sat
[2020-05-15 11:48:53] [INFO ] Deduced a trap composed of 18 places in 82 ms
[2020-05-15 11:48:53] [INFO ] Deduced a trap composed of 18 places in 205 ms
[2020-05-15 11:48:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2020-05-15 11:48:54] [INFO ] [Real]Absence check using 34 positive place invariants in 51 ms returned sat
[2020-05-15 11:48:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2020-05-15 11:48:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:55] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2020-05-15 11:48:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 54 ms returned sat
[2020-05-15 11:48:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 121 ms returned sat
[2020-05-15 11:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:56] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2020-05-15 11:48:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:48:56] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 42 ms.
[2020-05-15 11:48:57] [INFO ] Added : 149 causal constraints over 30 iterations in 1726 ms. Result :sat
[2020-05-15 11:48:58] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 11:48:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 11:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:58] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2020-05-15 11:48:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:48:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-05-15 11:48:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2020-05-15 11:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:48:59] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-05-15 11:48:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:48:59] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 25 ms.
[2020-05-15 11:49:00] [INFO ] Added : 170 causal constraints over 35 iterations in 1457 ms. Result :sat
[2020-05-15 11:49:00] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 11:49:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 11:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:01] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-15 11:49:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 11:49:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 155 ms returned sat
[2020-05-15 11:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:02] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2020-05-15 11:49:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 11:49:02] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 30 ms.
[2020-05-15 11:49:03] [INFO ] Added : 154 causal constraints over 32 iterations in 1169 ms. Result :sat
[2020-05-15 11:49:03] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 11:49:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2020-05-15 11:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:03] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2020-05-15 11:49:03] [INFO ] [Real]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-05-15 11:49:04] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 57 ms.
[2020-05-15 11:49:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 11:49:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-05-15 11:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:04] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2020-05-15 11:49:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:49:04] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 24 ms.
[2020-05-15 11:49:06] [INFO ] Added : 166 causal constraints over 34 iterations in 1359 ms. Result :sat
[2020-05-15 11:49:06] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-05-15 11:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2020-05-15 11:49:06] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 11:49:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 11:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:06] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2020-05-15 11:49:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 11:49:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 117 ms returned sat
[2020-05-15 11:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:07] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2020-05-15 11:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:49:07] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 20 ms.
[2020-05-15 11:49:08] [INFO ] Added : 125 causal constraints over 25 iterations in 1135 ms. Result :sat
[2020-05-15 11:49:08] [INFO ] Deduced a trap composed of 22 places in 127 ms
[2020-05-15 11:49:09] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-05-15 11:49:09] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-05-15 11:49:09] [INFO ] Deduced a trap composed of 18 places in 94 ms
[2020-05-15 11:49:09] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-05-15 11:49:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 775 ms
[2020-05-15 11:49:09] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 11:49:09] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2020-05-15 11:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:10] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2020-05-15 11:49:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 11:49:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 11:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:10] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-05-15 11:49:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 11:49:10] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 18 ms.
[2020-05-15 11:49:11] [INFO ] Added : 94 causal constraints over 20 iterations in 950 ms. Result :sat
[2020-05-15 11:49:11] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 11:49:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 11:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:12] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-05-15 11:49:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 11:49:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 84 ms returned sat
[2020-05-15 11:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:12] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2020-05-15 11:49:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:49:12] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 18 ms.
[2020-05-15 11:49:14] [INFO ] Added : 142 causal constraints over 29 iterations in 1114 ms. Result :sat
[2020-05-15 11:49:14] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 11:49:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2020-05-15 11:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:14] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-15 11:49:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 11:49:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-15 11:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:15] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2020-05-15 11:49:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:49:15] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 47 ms.
[2020-05-15 11:49:16] [INFO ] Added : 86 causal constraints over 18 iterations in 828 ms. Result :sat
[2020-05-15 11:49:16] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 11:49:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 11:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:16] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2020-05-15 11:49:16] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 11:49:16] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 21 ms.
[2020-05-15 11:49:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 11:49:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2020-05-15 11:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:17] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2020-05-15 11:49:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:49:17] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 25 ms.
[2020-05-15 11:49:18] [INFO ] Added : 149 causal constraints over 30 iterations in 1284 ms. Result :sat
[2020-05-15 11:49:18] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 11:49:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2020-05-15 11:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:19] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2020-05-15 11:49:19] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:49:19] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 17 ms.
[2020-05-15 11:49:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 11:49:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-05-15 11:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:19] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2020-05-15 11:49:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 11:49:19] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 19 ms.
[2020-05-15 11:49:21] [INFO ] Added : 163 causal constraints over 35 iterations in 1659 ms. Result :sat
[2020-05-15 11:49:21] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 11:49:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 11:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:22] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2020-05-15 11:49:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 11:49:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2020-05-15 11:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:22] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2020-05-15 11:49:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 11:49:23] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 24 ms.
[2020-05-15 11:49:24] [INFO ] Added : 158 causal constraints over 32 iterations in 1308 ms. Result :sat
[2020-05-15 11:49:24] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 11:49:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 11:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:24] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2020-05-15 11:49:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 11:49:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 96 ms returned sat
[2020-05-15 11:49:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:25] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2020-05-15 11:49:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 11:49:25] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 22 ms.
[2020-05-15 11:49:27] [INFO ] Added : 166 causal constraints over 34 iterations in 1633 ms. Result :sat
[2020-05-15 11:49:27] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 11:49:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-05-15 11:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:27] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2020-05-15 11:49:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:49:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 11:49:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 84 ms returned sat
[2020-05-15 11:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:49:28] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2020-05-15 11:49:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 11:49:28] [INFO ] Computed and/alt/rep : 176/719/176 causal constraints in 21 ms.
[2020-05-15 11:49:30] [INFO ] Added : 173 causal constraints over 35 iterations in 1579 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 11:49:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-15 11:49:30] [INFO ] Flatten gal took : 195 ms
FORMULA DES-PT-30a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 11:49:30] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 11:49:31] [INFO ] Applying decomposition
[2020-05-15 11:49:31] [INFO ] Flatten gal took : 49 ms
[2020-05-15 11:49:31] [INFO ] Input system was already deterministic with 177 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/graph7395198144187182914.txt, -o, /tmp/graph7395198144187182914.bin, -w, /tmp/graph7395198144187182914.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/graph7395198144187182914.bin, -l, -1, -v, -w, /tmp/graph7395198144187182914.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 177 rows 234 cols
[2020-05-15 11:49:31] [INFO ] Computed 59 place invariants in 11 ms
inv : p0 + p183 + p184 = 1
inv : p0 + p173 + p174 = 1
inv : p0 + p213 + p214 + p215 + p216 + p217 + p222 + p223 = 1
inv : p0 + p161 + p174 - p178 + p190 + p194 - p206 = 1
inv : p141 + p142 - p143 - p144 = 0
inv : p0 + p224 + p225 + p226 + p227 + p228 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p145 + p146 = 1
inv : p162 - p174 + p178 - p190 - p194 + p206 = 0
inv : p0 + p151 + p152 = 1
inv : p0 + p159 + p174 - p176 + p190 + p192 - p206 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p171 + p174 - p188 + p190 + p204 - p206 = 1
inv : p0 + p203 + p204 + p209 + p210 = 1
inv : p0 + 58*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 - 60*p30 - 2*p31 - 4*p32 - 6*p33 - 8*p34 - 10*p35 - 12*p36 - 14*p37 - 16*p38 - 18*p39 - 20*p40 - 22*p41 - 24*p42 - 26*p43 - 28*p44 - 30*p45 - 32*p46 - 34*p47 - 36*p48 - 38*p49 - 40*p50 - 42*p51 - 44*p52 - 46*p53 - 48*p54 - 50*p55 - 52*p56 - 54*p57 - 56*p58 - 58*p59 - p152 - p154 - p158 - p214 - p216 - p217 + p219 - p222 + p224 + p228 + 2*p229 + p231 + p233 = 1
inv : p0 - 29*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + p127 + p130 + p154 + p158 + p213 + p214 + p216 + p217 + p222 + p223 - p224 - p229 - p231 = 1
inv : -p0 - 29*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + p152 + p156 + p174 + p190 - p206 - p209 + p212 + p214 + p216 + p220 - p229 - p231 = -1
inv : p0 + p122 + p123 = 1
inv : p0 + p193 + p194 + p209 + p210 = 1
inv : p0 + p169 + p174 - p186 + p190 + p202 - p206 = 1
inv : p0 + p157 + p158 = 1
inv : p166 - p174 + p182 - p190 - p198 + p206 = 0
inv : 3*p0 - 58*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 + 30*p30 + p31 + 2*p32 + 3*p33 + 4*p34 + 5*p35 + 6*p36 + 7*p37 + 8*p38 + 9*p39 + 10*p40 + 11*p41 + 12*p42 + 13*p43 + 14*p44 + 15*p45 + 16*p46 + 17*p47 + 18*p48 + 19*p49 + 20*p50 + 21*p51 + 22*p52 + 23*p53 + 24*p54 + 25*p55 + 26*p56 + 27*p57 + 28*p58 + 29*p59 + 30*p90 + p91 + 2*p92 + 3*p93 + 4*p94 + 5*p95 + 6*p96 + 7*p97 + 8*p98 + 9*p99 + 10*p100 + 11*p101 + 12*p102 + 13*p103 + 14*p104 + 15*p105 + 16*p106 + 17*p107 + 18*p108 + 19*p109 + 20*p110 + 21*p111 + 22*p112 + 23*p113 + 24*p114 + 25*p115 + 26*p116 + 27*p117 + 28*p118 + 29*p119 + p126 + p130 + p132 + p140 + p141 + p147 + p152 + p154 + p158 - p208 + p210 + p212 + p214 + p216 + p220 - p224 - p229 - p231 = 3
inv : p164 - p174 + p180 - p190 - p196 + p206 = 0
inv : p207 + p208 - p209 - p210 = 0
inv : p0 + p229 + p232 + p233 = 1
inv : p0 + p124 + p125 + p126 = 1
inv : p170 - p174 + p186 - p190 - p202 + p206 = 0
inv : p0 + p195 + p196 + p209 + p210 = 1
inv : p0 + p131 = 1
inv : p0 + p167 + p174 - p184 + p190 + p200 - p206 = 1
inv : p0 + p149 + p150 = 1
inv : p160 - p174 + p176 - p190 - p192 + p206 = 0
inv : p0 + p189 + p190 = 1
inv : -p0 - 58*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 + 60*p30 + 2*p31 + 4*p32 + 6*p33 + 8*p34 + 10*p35 + 12*p36 + 14*p37 + 16*p38 + 18*p39 + 20*p40 + 22*p41 + 24*p42 + 26*p43 + 28*p44 + 30*p45 + 32*p46 + 34*p47 + 36*p48 + 38*p49 + 40*p50 + 42*p51 + 44*p52 + 46*p53 + 48*p54 + 50*p55 + 52*p56 + 54*p57 + 56*p58 + 58*p59 + p152 + p154 + p158 + p214 + p218 + p222 - p224 - p228 - 2*p229 - p231 - p233 = -1
inv : p0 + p197 + p198 + p209 + p210 = 1
inv : p137 + p138 - p139 - p140 = 0
inv : p0 + p187 + p188 = 1
inv : p0 + p199 + p200 + p209 + p210 = 1
[2020-05-15 11:49:31] [INFO ] Decomposing Gal with order
inv : p0 + p132 + p133 = 1
inv : 2*p0 + 29*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 - 30*p30 - p31 - 2*p32 - 3*p33 - 4*p34 - 5*p35 - 6*p36 - 7*p37 - 8*p38 - 9*p39 - 10*p40 - 11*p41 - 12*p42 - 13*p43 - 14*p44 - 15*p45 - 16*p46 - 17*p47 - 18*p48 - 19*p49 - 20*p50 - 21*p51 - 22*p52 - 23*p53 - 24*p54 - 25*p55 - 26*p56 - 27*p57 - 28*p58 - 29*p59 - p152 + p155 - p174 - p190 + p206 + p209 - p212 - p214 - p216 - p220 + p229 + p231 = 2
inv : p0 + p229 + p230 + p231 = 1
inv : p0 + p129 + p130 = 1
inv : p220 + p221 - p222 - p223 = 0
inv : p0 + p177 + p178 = 1
inv : p168 - p174 + p184 - p190 - p200 + p206 = 0
inv : p0 + p165 + p174 - p182 + p190 + p198 - p206 = 1
inv : p0 + p201 + p202 + p209 + p210 = 1
inv : p0 + p191 + p192 + p209 + p210 = 1
inv : p0 + p211 + p212 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p205 + p206 + p209 + p210 = 1
inv : 29*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 - 30*p30 - p31 - 2*p32 - 3*p33 - 4*p34 - 5*p35 - 6*p36 - 7*p37 - 8*p38 - 9*p39 - 10*p40 - 11*p41 - 12*p42 - 13*p43 - 14*p44 - 15*p45 - 16*p46 - 17*p47 - 18*p48 - 19*p49 - 20*p50 - 21*p51 - 22*p52 - 23*p53 - 24*p54 - 25*p55 - 26*p56 - 27*p57 - 28*p58 - 29*p59 + p128 - p130 - p154 - p158 - p213 - p214 - p216 - p217 - p222 - p223 + p224 + p229 + p231 = 0
inv : p172 - p174 + p188 - p190 - p204 + p206 = 0
inv : p0 + p163 + p174 - p180 + p190 + p196 - p206 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p185 + p186 = 1
Total of 59 invariants.
[2020-05-15 11:49:31] [INFO ] Computed 59 place invariants in 35 ms
[2020-05-15 11:49:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 11:49:31] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-15 11:49:31] [INFO ] Flatten gal took : 141 ms
[2020-05-15 11:49:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 19 ms.
[2020-05-15 11:49:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 27 ms
[2020-05-15 11:49:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 8 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 12 LTL properties
Checking formula 0 : !((X(X(!((X("((i0.i0.u6.p135==1)&&(i0.i0.u11.p145==1))"))U(X(X("((u13.p84==1)&&(u13.p149==1))"))))))))
Formula 0 simplified : !XX!(X"((i0.i0.u6.p135==1)&&(i0.i0.u11.p145==1))" U XX"((u13.p84==1)&&(u13.p149==1))")
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 8 ordering constraints for composite.
built 18 ordering constraints for composite.
built 5 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 30 ordering constraints for composite.
[2020-05-15 11:49:32] [INFO ] Proved 234 variables to be positive in 636 ms
[2020-05-15 11:49:32] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2020-05-15 11:49:32] [INFO ] Computation of disable matrix completed :0/177 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:49:32] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:49:32] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2020-05-15 11:49:32] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:49:36] [INFO ] Computing symmetric co enabling matrix : 177 transitions.
[2020-05-15 11:49:37] [INFO ] Computation of co-enabling matrix(0/177) took 427 ms. Total solver calls (SAT/UNSAT): 105(105/0)
[2020-05-15 11:49:40] [INFO ] Computation of co-enabling matrix(13/177) took 3761 ms. Total solver calls (SAT/UNSAT): 1090(810/280)
[2020-05-15 11:49:43] [INFO ] Computation of co-enabling matrix(18/177) took 6889 ms. Total solver calls (SAT/UNSAT): 1610(1320/290)
[2020-05-15 11:49:46] [INFO ] Computation of co-enabling matrix(23/177) took 9922 ms. Total solver calls (SAT/UNSAT): 2105(1805/300)
[2020-05-15 11:49:49] [INFO ] Computation of co-enabling matrix(31/177) took 13098 ms. Total solver calls (SAT/UNSAT): 2845(2529/316)
Reverse transition relation is NOT exact ! Due to transitions t1, t146, t147, t180, u13.t129, u14.t11, u48.t5, u48.t40, i0.i0.u0.t10, i0.i0.u6.t189, i0.i1.t0, i0.i1.t178, i0.i1.t188, i0.i1.u1.t9, i1.u2.t8, i1.u2.t70, i1.u2.t74, i1.u2.t75, i1.u2.t76, i1.u2.t77, i1.u2.t78, i1.u2.t79, i1.u2.t80, i1.u2.t81, i1.u2.t82, i1.u2.t83, i1.u2.t84, i1.u2.t85, i1.u2.t86, i1.u2.t87, i1.u2.t88, i1.u2.t89, i1.u2.t90, i1.u2.t91, i1.u2.t92, i1.u2.t93, i1.u2.t94, i1.u2.t95, i1.u2.t96, i1.u2.t97, i1.u2.t98, i1.u2.t99, i12.t158, i12.t4, i12.t3, i12.u16.t155, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/129/46/175
[2020-05-15 11:49:53] [INFO ] Computation of co-enabling matrix(40/177) took 16417 ms. Total solver calls (SAT/UNSAT): 3601(3267/334)
Computing Next relation with stutter on 2.19322e+06 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
2276 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,22.8283,422300,1,0,992890,80304,2127,955282,3297,432580,1463712
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-30a-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G((X((X("((i0.i0.u6.p136!=1)||(u13.p150!=1))"))||("((i1.u2.p101==1)&&(i1.u2.p124==1))")))||("((i1.u2.p101==1)&&(i1.u2.p124==1))")))U("((((i0.i0.u6.p136==1)&&(u13.p150==1))&&(u48.p52==1))&&(u48.p229==1))")))
Formula 1 simplified : !(G("((i1.u2.p101==1)&&(i1.u2.p124==1))" | X("((i1.u2.p101==1)&&(i1.u2.p124==1))" | X"((i0.i0.u6.p136!=1)||(u13.p150!=1))")) U "((((i0.i0.u6.p136==1)&&(u13.p150==1))&&(u48.p52==1))&&(u48.p229==1))")
Computing Next relation with stutter on 2.19322e+06 deadlock states
[2020-05-15 11:49:56] [INFO ] Computation of co-enabling matrix(46/177) took 19580 ms. Total solver calls (SAT/UNSAT): 4060(3714/346)
[2020-05-15 11:49:59] [INFO ] Computation of co-enabling matrix(51/177) took 22798 ms. Total solver calls (SAT/UNSAT): 4415(4059/356)
[2020-05-15 11:50:02] [INFO ] Computation of co-enabling matrix(58/177) took 25996 ms. Total solver calls (SAT/UNSAT): 4870(4500/370)
[2020-05-15 11:50:06] [INFO ] Computation of co-enabling matrix(64/177) took 29171 ms. Total solver calls (SAT/UNSAT): 5221(4839/382)
[2020-05-15 11:50:09] [INFO ] Computation of co-enabling matrix(76/177) took 32231 ms. Total solver calls (SAT/UNSAT): 5752(5346/406)
[2020-05-15 11:50:12] [INFO ] Computation of co-enabling matrix(112/177) took 35249 ms. Total solver calls (SAT/UNSAT): 6593(6128/465)
[2020-05-15 11:50:14] [INFO ] Computation of Finished co-enabling matrix. took 37514 ms. Total solver calls (SAT/UNSAT): 6949(6371/578)
[2020-05-15 11:50:14] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2020-05-15 11:50:14] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-15 11:50:16] [INFO ] Computation of Completed DNA matrix. took 2297 ms. Total solver calls (SAT/UNSAT): 26(0/26)
[2020-05-15 11:50:16] [INFO ] Built C files in 45701ms 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 5019 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](( X(( X((LTLAP2==true))) || ( (LTLAP3==true)) )) || ( (LTLAP3==true)) ))U((LTLAP4==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, ([](( X(( X((LTLAP2==true))) || ( (LTLAP3==true)) )) || ( (LTLAP3==true)) ))U((LTLAP4==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, ([](( X(( X((LTLAP2==true))) || ( (LTLAP3==true)) )) || ( (LTLAP3==true)) ))U((LTLAP4==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)
59 unique states visited
59 strongly connected components in search stack
59 transitions explored
59 items max in DFS search stack
53706 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,559.895,7492600,1,0,1.45613e+07,91867,2257,1.23301e+07,3370,607907,12559060
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DES-PT-30a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G(!(F((G(X("((i1.u2.p106==1)&&(i1.u2.p124==1))")))||("((u48.p43==1)&&(u48.p229==1))")))))||(G(("((i12.u45.p218==1)&&(i12.u47.p228==1))")U("((i12.u4.p130==1)&&(i12.u16.p224==1))"))))))
Formula 2 simplified : !F(G!F("((u48.p43==1)&&(u48.p229==1))" | GX"((i1.u2.p106==1)&&(i1.u2.p124==1))") | G("((i12.u45.p218==1)&&(i12.u47.p228==1))" U "((i12.u4.p130==1)&&(i12.u16.p224==1))"))
Computing Next relation with stutter on 2.19322e+06 deadlock states
Detected timeout of ITS tools.
[2020-05-15 12:09:54] [INFO ] Applying decomposition
[2020-05-15 12:09:54] [INFO ] Flatten gal took : 30 ms
[2020-05-15 12:09:54] [INFO ] Decomposing Gal with order
[2020-05-15 12:09:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 12:09:54] [INFO ] Removed a total of 221 redundant transitions.
[2020-05-15 12:09:54] [INFO ] Flatten gal took : 80 ms
[2020-05-15 12:09:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 10 ms.
[2020-05-15 12:09:54] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-15 12:09:54] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 10 LTL properties
Checking formula 0 : !((F((G(!(F((G(X("((u4.p106==1)&&(u7.p124==1))")))||("((u2.p43==1)&&(i52.u61.p229==1))")))))||(G(("((i50.u53.p218==1)&&(u56.p228==1))")U("((u9.p130==1)&&(u56.p224==1))"))))))
Formula 0 simplified : !F(G!F("((u2.p43==1)&&(i52.u61.p229==1))" | GX"((u4.p106==1)&&(u7.p124==1))") | G("((i50.u53.p218==1)&&(u56.p228==1))" U "((u9.p130==1)&&(u56.p224==1))"))
built 47 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-15 12:30:17] [INFO ] Flatten gal took : 39 ms
[2020-05-15 12:30:17] [INFO ] Input system was already deterministic with 177 transitions.
[2020-05-15 12:30:17] [INFO ] Transformed 234 places.
[2020-05-15 12:30:17] [INFO ] Transformed 177 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-15 12:30:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-15 12:30:17] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 10 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(!(F((G(X("((p106==1)&&(p124==1))")))||("((p43==1)&&(p229==1))")))))||(G(("((p218==1)&&(p228==1))")U("((p130==1)&&(p224==1))"))))))
Formula 0 simplified : !F(G!F("((p43==1)&&(p229==1))" | GX"((p106==1)&&(p124==1))") | G("((p218==1)&&(p228==1))" U "((p130==1)&&(p224==1))"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DES-PT-30a"
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 DES-PT-30a, 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 r051-ebro-158902545900274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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