Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258000713.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000713
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 248K Apr 27 15:14 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 Peterson-PT-3-00
FORMULA_NAME Peterson-PT-3-01
FORMULA_NAME Peterson-PT-3-02
FORMULA_NAME Peterson-PT-3-03
FORMULA_NAME Peterson-PT-3-04
FORMULA_NAME Peterson-PT-3-05
FORMULA_NAME Peterson-PT-3-06
FORMULA_NAME Peterson-PT-3-07
FORMULA_NAME Peterson-PT-3-08
FORMULA_NAME Peterson-PT-3-09
FORMULA_NAME Peterson-PT-3-10
FORMULA_NAME Peterson-PT-3-11
FORMULA_NAME Peterson-PT-3-12
FORMULA_NAME Peterson-PT-3-13
FORMULA_NAME Peterson-PT-3-14
FORMULA_NAME Peterson-PT-3-15

=== Now, execution of the tool begins

BK_START 1590022942323

[2020-05-21 01:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-21 01:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:02:25] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2020-05-21 01:02:25] [INFO ] Transformed 244 places.
[2020-05-21 01:02:25] [INFO ] Transformed 332 transitions.
[2020-05-21 01:02:25] [INFO ] Parsed PT model containing 244 places and 332 transitions in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 97 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 395 ms. (steps per millisecond=253 ) properties seen :[1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1]
[2020-05-21 01:02:26] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:02:26] [INFO ] Computed 15 place invariants in 30 ms
[2020-05-21 01:02:26] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:26] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-05-21 01:02:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-21 01:02:26] [INFO ] [Real]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:27] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2020-05-21 01:02:27] [INFO ] [Nat]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 9 places in 258 ms
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 9 places in 214 ms
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 16 places in 140 ms
[2020-05-21 01:02:28] [INFO ] Deduced a trap composed of 9 places in 281 ms
[2020-05-21 01:02:28] [INFO ] Deduced a trap composed of 23 places in 285 ms
[2020-05-21 01:02:28] [INFO ] Deduced a trap composed of 12 places in 192 ms
[2020-05-21 01:02:28] [INFO ] Deduced a trap composed of 38 places in 106 ms
[2020-05-21 01:02:28] [INFO ] Deduced a trap composed of 54 places in 100 ms
[2020-05-21 01:02:29] [INFO ] Deduced a trap composed of 53 places in 174 ms
[2020-05-21 01:02:29] [INFO ] Deduced a trap composed of 36 places in 138 ms
[2020-05-21 01:02:29] [INFO ] Deduced a trap composed of 35 places in 102 ms
[2020-05-21 01:02:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2272 ms
[2020-05-21 01:02:29] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 28 ms.
[2020-05-21 01:02:31] [INFO ] Added : 304 causal constraints over 61 iterations in 1865 ms. Result :sat
[2020-05-21 01:02:31] [INFO ] Deduced a trap composed of 30 places in 121 ms
[2020-05-21 01:02:31] [INFO ] Deduced a trap composed of 16 places in 230 ms
[2020-05-21 01:02:31] [INFO ] Deduced a trap composed of 54 places in 95 ms
[2020-05-21 01:02:31] [INFO ] Deduced a trap composed of 62 places in 111 ms
[2020-05-21 01:02:32] [INFO ] Deduced a trap composed of 34 places in 73 ms
[2020-05-21 01:02:32] [INFO ] Deduced a trap composed of 74 places in 141 ms
[2020-05-21 01:02:32] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-05-21 01:02:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1141 ms
[2020-05-21 01:02:32] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:02:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:32] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-05-21 01:02:32] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:02:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:33] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2020-05-21 01:02:33] [INFO ] [Nat]Added 66 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:02:33] [INFO ] Deduced a trap composed of 17 places in 330 ms
[2020-05-21 01:02:34] [INFO ] Deduced a trap composed of 20 places in 304 ms
[2020-05-21 01:02:34] [INFO ] Deduced a trap composed of 16 places in 442 ms
[2020-05-21 01:02:35] [INFO ] Deduced a trap composed of 16 places in 608 ms
[2020-05-21 01:02:36] [INFO ] Deduced a trap composed of 38 places in 830 ms
[2020-05-21 01:02:36] [INFO ] Deduced a trap composed of 59 places in 198 ms
[2020-05-21 01:02:36] [INFO ] Deduced a trap composed of 38 places in 514 ms
[2020-05-21 01:02:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3454 ms
[2020-05-21 01:02:37] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 90 ms.
[2020-05-21 01:02:38] [INFO ] Added : 304 causal constraints over 61 iterations in 1665 ms. Result :sat
[2020-05-21 01:02:38] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2020-05-21 01:02:38] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-05-21 01:02:39] [INFO ] Deduced a trap composed of 39 places in 95 ms
[2020-05-21 01:02:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 462 ms
[2020-05-21 01:02:39] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned unsat
[2020-05-21 01:02:39] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-21 01:02:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:39] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-05-21 01:02:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:02:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:39] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2020-05-21 01:02:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:39] [INFO ] Deduced a trap composed of 9 places in 133 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 9 places in 166 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 12 places in 129 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 53 places in 61 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 35 places in 47 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2020-05-21 01:02:40] [INFO ] Deduced a trap composed of 31 places in 89 ms
[2020-05-21 01:02:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 996 ms
[2020-05-21 01:02:40] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-21 01:02:42] [INFO ] Added : 304 causal constraints over 61 iterations in 1398 ms. Result :sat
[2020-05-21 01:02:42] [INFO ] Deduced a trap composed of 53 places in 117 ms
[2020-05-21 01:02:42] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2020-05-21 01:02:42] [INFO ] Deduced a trap composed of 53 places in 93 ms
[2020-05-21 01:02:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 451 ms
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned unsat
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned unsat
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:43] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-21 01:02:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:02:43] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:43] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2020-05-21 01:02:43] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:02:43] [INFO ] Deduced a trap composed of 36 places in 138 ms
[2020-05-21 01:02:43] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2020-05-21 01:02:43] [INFO ] Deduced a trap composed of 38 places in 86 ms
[2020-05-21 01:02:43] [INFO ] Deduced a trap composed of 49 places in 126 ms
[2020-05-21 01:02:44] [INFO ] Deduced a trap composed of 13 places in 297 ms
[2020-05-21 01:02:44] [INFO ] Deduced a trap composed of 49 places in 61 ms
[2020-05-21 01:02:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 942 ms
[2020-05-21 01:02:44] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-05-21 01:02:45] [INFO ] Added : 304 causal constraints over 61 iterations in 1272 ms. Result :sat
[2020-05-21 01:02:45] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2020-05-21 01:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2020-05-21 01:02:45] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-21 01:02:45] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:46] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-05-21 01:02:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-21 01:02:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:46] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-05-21 01:02:46] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 13 places in 80 ms
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 13 places in 91 ms
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 38 places in 73 ms
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-05-21 01:02:46] [INFO ] Deduced a trap composed of 57 places in 82 ms
[2020-05-21 01:02:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 720 ms
[2020-05-21 01:02:47] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2020-05-21 01:02:48] [INFO ] Added : 303 causal constraints over 61 iterations in 1454 ms. Result :sat
[2020-05-21 01:02:48] [INFO ] Deduced a trap composed of 41 places in 75 ms
[2020-05-21 01:02:48] [INFO ] Deduced a trap composed of 38 places in 95 ms
[2020-05-21 01:02:48] [INFO ] Deduced a trap composed of 57 places in 73 ms
[2020-05-21 01:02:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2020-05-21 01:02:48] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:02:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-21 01:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:49] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-05-21 01:02:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-21 01:02:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:49] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2020-05-21 01:02:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 44 places in 74 ms
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-05-21 01:02:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2020-05-21 01:02:49] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2020-05-21 01:02:51] [INFO ] Added : 304 causal constraints over 61 iterations in 1377 ms. Result :sat
[2020-05-21 01:02:51] [INFO ] Deduced a trap composed of 49 places in 137 ms
[2020-05-21 01:02:51] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-05-21 01:02:51] [INFO ] Deduced a trap composed of 31 places in 58 ms
[2020-05-21 01:02:51] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-05-21 01:02:51] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-05-21 01:02:52] [INFO ] Deduced a trap composed of 13 places in 119 ms
[2020-05-21 01:02:52] [INFO ] Deduced a trap composed of 49 places in 110 ms
[2020-05-21 01:02:52] [INFO ] Deduced a trap composed of 42 places in 104 ms
[2020-05-21 01:02:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1106 ms
[2020-05-21 01:02:52] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:52] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-05-21 01:02:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:52] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 50 places in 104 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 52 places in 96 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 16 places in 81 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 13 places in 103 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 49 places in 107 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 47 places in 108 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 41 places in 64 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 35 places in 120 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 32 places in 91 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 31 places in 106 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 31 places in 93 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 12 places in 103 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 50 places in 83 ms
[2020-05-21 01:02:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1679 ms
[2020-05-21 01:02:54] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-21 01:02:56] [INFO ] Added : 304 causal constraints over 61 iterations in 1436 ms. Result :sat
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 48 places in 121 ms
[2020-05-21 01:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2020-05-21 01:02:56] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:56] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:02:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:56] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 38 places in 108 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 56 places in 86 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 56 places in 97 ms
[2020-05-21 01:02:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 485 ms
[2020-05-21 01:02:57] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-21 01:02:58] [INFO ] Added : 304 causal constraints over 61 iterations in 1338 ms. Result :sat
[2020-05-21 01:02:58] [INFO ] Deduced a trap composed of 70 places in 147 ms
[2020-05-21 01:02:58] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-05-21 01:02:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2020-05-21 01:02:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-21 01:02:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-21 01:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:59] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-21 01:02:59] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:02:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-05-21 01:02:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:59] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2020-05-21 01:02:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 26 places in 95 ms
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 26 places in 88 ms
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 13 places in 83 ms
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-05-21 01:03:00] [INFO ] Deduced a trap composed of 9 places in 58 ms
[2020-05-21 01:03:00] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-05-21 01:03:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 571 ms
[2020-05-21 01:03:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 31 ms.
[2020-05-21 01:03:01] [INFO ] Added : 303 causal constraints over 61 iterations in 1643 ms. Result :sat
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 27 places in 95 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 27 places in 71 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 35 places in 93 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 27 places in 204 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 39 places in 75 ms
[2020-05-21 01:03:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1013 ms
[2020-05-21 01:03:02] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:03] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2020-05-21 01:03:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-05-21 01:03:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:03] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-05-21 01:03:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 9 places in 124 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 57 places in 108 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 56 places in 121 ms
[2020-05-21 01:03:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 507 ms
[2020-05-21 01:03:04] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-21 01:03:05] [INFO ] Added : 304 causal constraints over 61 iterations in 1498 ms. Result :sat
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 38 places in 95 ms
[2020-05-21 01:03:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2020-05-21 01:03:05] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:03:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:06] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-05-21 01:03:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:06] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 11 places in 95 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 39 places in 102 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 57 places in 99 ms
[2020-05-21 01:03:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 343 ms
[2020-05-21 01:03:06] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-21 01:03:08] [INFO ] Added : 304 causal constraints over 61 iterations in 1339 ms. Result :sat
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 45 places in 115 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 16 places in 112 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 37 places in 119 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 45 places in 107 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 27 places in 71 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 62 places in 66 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 39 places in 86 ms
[2020-05-21 01:03:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1350 ms
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-21 01:03:09] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-21 01:03:09] [INFO ] Flatten gal took : 134 ms
FORMULA Peterson-PT-3-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:03:09] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:03:10] [INFO ] Applying decomposition
[2020-05-21 01:03:10] [INFO ] Flatten gal took : 39 ms
[2020-05-21 01:03:10] [INFO ] Input system was already deterministic with 332 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:03:10] [INFO ] Computed 15 place invariants in 5 ms
inv : WantSection_1_F - Idle_1 = 0
inv : WantSection_1_T + Idle_1 = 1
inv : -IsEndLoop_3_0_0 - IsEndLoop_3_1_0 - IsEndLoop_3_2_0 - IsEndLoop_3_0_1 - IsEndLoop_3_1_1 - IsEndLoop_3_2_1 - IsEndLoop_3_0_2 - IsEndLoop_3_1_2 - IsEndLoop_3_2_2 - IsEndLoop_3_0_3 - IsEndLoop_3_1_3 - IsEndLoop_3_2_3 - EndTurn_3_0 - EndTurn_3_1 - EndTurn_3_2 - BeginLoop_3_1_0 - BeginLoop_3_0_0 - BeginLoop_3_0_1 - BeginLoop_3_2_0 - BeginLoop_3_2_1 - BeginLoop_3_1_1 - BeginLoop_3_1_2 - BeginLoop_3_0_2 - BeginLoop_3_0_3 - BeginLoop_3_2_2 - BeginLoop_3_2_3 - BeginLoop_3_1_3 + WantSection_3_T - TestAlone_3_2_0 - TestAlone_3_1_0 - TestAlone_3_0_0 - TestAlone_3_2_1 - TestAlone_3_0_2 - TestAlone_3_1_2 - TestAlone_3_0_1 - TestAlone_3_1_1 - TestTurn_3_0 - TestAlone_3_2_2 - TestIdentity_3_0_0 - TestIdentity_3_1_0 - TestTurn_3_1 - TestTurn_3_2 - TestIdentity_3_1_1 - TestIdentity_3_2_1 - TestIdentity_3_2_0 - TestIdentity_3_0_1 - TestIdentity_3_0_3 - TestIdentity_3_2_2 - TestIdentity_3_1_2 - TestIdentity_3_0_2 - TestIdentity_3_2_3 - TestIdentity_3_1_3 - AskForSection_3_1 - AskForSection_3_0 - CS_3 - AskForSection_3_2 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_2_2 + IsEndLoop_2_0_3 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_2_2 + BeginLoop_2_2_3 + BeginLoop_2_1_3 + TestAlone_2_2_0 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_1 + TestAlone_2_2_1 + TestAlone_2_2_3 + TestTurn_2_0 + TestAlone_2_0_3 + TestAlone_2_1_3 + TestIdentity_2_0_0 + TestIdentity_2_1_0 + TestTurn_2_1 + TestTurn_2_2 + TestIdentity_2_1_1 + TestIdentity_2_2_1 + TestIdentity_2_2_0 + TestIdentity_2_0_1 + TestIdentity_2_0_3 + TestIdentity_2_2_2 + TestIdentity_2_1_2 + TestIdentity_2_0_2 + TestIdentity_2_2_3 + TestIdentity_2_1_3 + AskForSection_2_1 + AskForSection_2_0 + Idle_2 + CS_2 + AskForSection_2_2 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_2_2 + IsEndLoop_3_0_3 + IsEndLoop_3_1_3 + IsEndLoop_3_2_3 + EndTurn_3_0 + EndTurn_3_1 + EndTurn_3_2 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + BeginLoop_3_0_1 + BeginLoop_3_2_0 + BeginLoop_3_2_1 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_3_2_2 + BeginLoop_3_2_3 + BeginLoop_3_1_3 + TestAlone_3_2_0 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_2_1 + TestAlone_3_0_2 + TestAlone_3_1_2 + TestAlone_3_0_1 + TestAlone_3_1_1 + TestTurn_3_0 + TestAlone_3_2_2 + TestIdentity_3_0_0 + TestIdentity_3_1_0 + TestTurn_3_1 + TestTurn_3_2 + TestIdentity_3_1_1 + TestIdentity_3_2_1 + TestIdentity_3_2_0 + TestIdentity_3_0_1 + TestIdentity_3_0_3 + TestIdentity_3_2_2 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_2_3 + TestIdentity_3_1_3 + AskForSection_3_1 + AskForSection_3_0 + Idle_3 + CS_3 + AskForSection_3_2 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_2_2 + IsEndLoop_2_0_3 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_2_2 + BeginLoop_2_2_3 + BeginLoop_2_1_3 + WantSection_2_F + TestAlone_2_2_0 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_1 + TestAlone_2_2_1 + TestAlone_2_2_3 + TestTurn_2_0 + TestAlone_2_0_3 + TestAlone_2_1_3 + TestIdentity_2_0_0 + TestIdentity_2_1_0 + TestTurn_2_1 + TestTurn_2_2 + TestIdentity_2_1_1 + TestIdentity_2_2_1 + TestIdentity_2_2_0 + TestIdentity_2_0_1 + TestIdentity_2_0_3 + TestIdentity_2_2_2 + TestIdentity_2_1_2 + TestIdentity_2_0_2 + TestIdentity_2_2_3 + TestIdentity_2_1_3 + AskForSection_2_1 + AskForSection_2_0 + CS_2 + AskForSection_2_2 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_2_2 + IsEndLoop_1_0_3 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_2_0 + BeginLoop_1_2_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_0_2 + BeginLoop_1_0_3 + BeginLoop_1_2_2 + BeginLoop_1_2_3 + BeginLoop_1_1_3 + TestAlone_1_0_0 + TestAlone_1_2_0 + TestAlone_1_1_0 + TestAlone_1_0_2 + TestAlone_1_1_2 + TestAlone_1_2_3 + TestTurn_1_0 + TestAlone_1_2_2 + TestAlone_1_0_3 + TestAlone_1_1_3 + TestIdentity_1_0_0 + TestIdentity_1_1_0 + TestTurn_1_1 + TestTurn_1_2 + TestIdentity_1_1_1 + TestIdentity_1_2_1 + TestIdentity_1_2_0 + TestIdentity_1_0_1 + TestIdentity_1_0_3 + TestIdentity_1_2_2 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + TestIdentity_1_2_3 + TestIdentity_1_1_3 + AskForSection_1_1 + AskForSection_1_0 + Idle_1 + CS_1 + AskForSection_1_2 = 1
inv : -IsEndLoop_2_0_0 - IsEndLoop_2_1_0 - IsEndLoop_2_2_0 - IsEndLoop_2_0_1 - IsEndLoop_2_1_1 - IsEndLoop_2_2_1 - IsEndLoop_2_0_2 - IsEndLoop_2_1_2 - IsEndLoop_2_2_2 - IsEndLoop_2_0_3 - IsEndLoop_2_1_3 - IsEndLoop_2_2_3 - EndTurn_2_0 - EndTurn_2_1 - EndTurn_2_2 - BeginLoop_2_1_0 - BeginLoop_2_0_0 - BeginLoop_2_0_1 - BeginLoop_2_2_0 - BeginLoop_2_2_1 - BeginLoop_2_1_1 - BeginLoop_2_1_2 - BeginLoop_2_0_2 - BeginLoop_2_0_3 - BeginLoop_2_2_2 - BeginLoop_2_2_3 - BeginLoop_2_1_3 + WantSection_2_T - TestAlone_2_2_0 - TestAlone_2_1_0 - TestAlone_2_0_0 - TestAlone_2_0_1 - TestAlone_2_1_1 - TestAlone_2_2_1 - TestAlone_2_2_3 - TestTurn_2_0 - TestAlone_2_0_3 - TestAlone_2_1_3 - TestIdentity_2_0_0 - TestIdentity_2_1_0 - TestTurn_2_1 - TestTurn_2_2 - TestIdentity_2_1_1 - TestIdentity_2_2_1 - TestIdentity_2_2_0 - TestIdentity_2_0_1 - TestIdentity_2_0_3 - TestIdentity_2_2_2 - TestIdentity_2_1_2 - TestIdentity_2_0_2 - TestIdentity_2_2_3 - TestIdentity_2_1_3 - AskForSection_2_1 - AskForSection_2_0 - CS_2 - AskForSection_2_2 = 0
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + EndTurn_0_0 + EndTurn_0_1 + EndTurn_0_2 + BeginLoop_0_0_0 + BeginLoop_0_2_0 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_2_1 + BeginLoop_0_2_2 + BeginLoop_0_1_2 + BeginLoop_0_1_3 + BeginLoop_0_0_3 + BeginLoop_0_2_3 + TestAlone_0_0_2 + TestAlone_0_1_2 + TestAlone_0_2_2 + TestAlone_0_0_1 + TestAlone_0_1_1 + TestAlone_0_2_1 + TestAlone_0_2_3 + TestTurn_0_0 + TestTurn_0_1 + TestAlone_0_0_3 + TestAlone_0_1_3 + TestIdentity_0_1_0 + TestIdentity_0_2_0 + TestTurn_0_2 + TestIdentity_0_0_0 + TestIdentity_0_2_1 + TestIdentity_0_0_2 + TestIdentity_0_0_1 + TestIdentity_0_1_1 + TestIdentity_0_1_3 + TestIdentity_0_0_3 + TestIdentity_0_2_2 + TestIdentity_0_1_2 + TestIdentity_0_2_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + Idle_0 + CS_0 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : Turn_2_1 + Turn_2_2 + Turn_2_0 + Turn_2_3 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_2_2 + IsEndLoop_3_0_3 + IsEndLoop_3_1_3 + IsEndLoop_3_2_3 + EndTurn_3_0 + EndTurn_3_1 + EndTurn_3_2 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + BeginLoop_3_0_1 + BeginLoop_3_2_0 + BeginLoop_3_2_1 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_3_2_2 + BeginLoop_3_2_3 + BeginLoop_3_1_3 + WantSection_3_F + TestAlone_3_2_0 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_2_1 + TestAlone_3_0_2 + TestAlone_3_1_2 + TestAlone_3_0_1 + TestAlone_3_1_1 + TestTurn_3_0 + TestAlone_3_2_2 + TestIdentity_3_0_0 + TestIdentity_3_1_0 + TestTurn_3_1 + TestTurn_3_2 + TestIdentity_3_1_1 + TestIdentity_3_2_1 + TestIdentity_3_2_0 + TestIdentity_3_0_1 + TestIdentity_3_0_3 + TestIdentity_3_2_2 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_2_3 + TestIdentity_3_1_3 + AskForSection_3_1 + AskForSection_3_0 + CS_3 + AskForSection_3_2 = 1
inv : Turn_1_2 + Turn_1_0 + Turn_1_1 + Turn_1_3 = 1
inv : Turn_0_2 + Turn_0_1 + Turn_0_0 + Turn_0_3 = 1
inv : WantSection_0_T + Idle_0 = 1
Total of 15 invariants.
[2020-05-21 01:03:10] [INFO ] Computed 15 place invariants in 7 ms
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/graph3456048010182653827.txt, -o, /tmp/graph3456048010182653827.bin, -w, /tmp/graph3456048010182653827.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/graph3456048010182653827.bin, -l, -1, -v, -w, /tmp/graph3456048010182653827.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:03:11] [INFO ] Decomposing Gal with order
[2020-05-21 01:03:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:03:11] [INFO ] Removed a total of 113 redundant transitions.
[2020-05-21 01:03:11] [INFO ] Flatten gal took : 608 ms
[2020-05-21 01:03:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 25 ms.
[2020-05-21 01:03:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-21 01:03:12] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((X(F((("((((((((((((gu2.TestTurn_0_0+gu2.TestTurn_1_0)+gu2.TestTurn_2_0)+gu2.TestTurn_3_0)+gu2.TestTurn_0_1)+gu2.TestTurn_0_2)+gu2.TestTurn_3_1)+gu2.TestTurn_2_1)+gu2.TestTurn_1_1)+gu2.TestTurn_3_2)+gu2.TestTurn_2_2)+gu2.TestTurn_1_2)>=4)")U((F("((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)>=1)"))&&("((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)>=1)")))||("(((((((((((((gu2.TestTurn_0_0+gu2.TestTurn_1_0)+gu2.TestTurn_2_0)+gu2.TestTurn_3_0)+gu2.TestTurn_0_1)+gu2.TestTurn_0_2)+gu2.TestTurn_3_1)+gu2.TestTurn_2_1)+gu2.TestTurn_1_1)+gu2.TestTurn_3_2)+gu2.TestTurn_2_2)+gu2.TestTurn_1_2)<=(((gu2.Idle_3+gu2.Idle_2)+gu2.Idle_1)+gu2.Idle_0))&&((((((((((((gu0.AskForSection_0_2+gu0.AskForSection_3_1)+gu0.AskForSection_2_1)+gu0.AskForSection_1_1)+gu0.AskForSection_0_1)+gu0.AskForSection_3_0)+gu0.AskForSection_2_0)+gu0.AskForSection_1_0)+gu0.AskForSection_0_0)+gu0.AskForSection_3_2)+gu0.AskForSection_1_2)+gu0.AskForSection_2_2)<=(((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)))")))))
Formula 0 simplified : !XF("(((((((((((((gu2.TestTurn_0_0+gu2.TestTurn_1_0)+gu2.TestTurn_2_0)+gu2.TestTurn_3_0)+gu2.TestTurn_0_1)+gu2.TestTurn_0_2)+gu2.TestTurn_3_1)+gu2.TestTurn_2_1)+gu2.TestTurn_1_1)+gu2.TestTurn_3_2)+gu2.TestTurn_2_2)+gu2.TestTurn_1_2)<=(((gu2.Idle_3+gu2.Idle_2)+gu2.Idle_1)+gu2.Idle_0))&&((((((((((((gu0.AskForSection_0_2+gu0.AskForSection_3_1)+gu0.AskForSection_2_1)+gu0.AskForSection_1_1)+gu0.AskForSection_0_1)+gu0.AskForSection_3_0)+gu0.AskForSection_2_0)+gu0.AskForSection_1_0)+gu0.AskForSection_0_0)+gu0.AskForSection_3_2)+gu0.AskForSection_1_2)+gu0.AskForSection_2_2)<=(((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)))" | ("((((((((((((gu2.TestTurn_0_0+gu2.TestTurn_1_0)+gu2.TestTurn_2_0)+gu2.TestTurn_3_0)+gu2.TestTurn_0_1)+gu2.TestTurn_0_2)+gu2.TestTurn_3_1)+gu2.TestTurn_2_1)+gu2.TestTurn_1_1)+gu2.TestTurn_3_2)+gu2.TestTurn_2_2)+gu2.TestTurn_1_2)>=4)" U ("((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)>=1)" & F"((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)>=1)")))
[2020-05-21 01:03:13] [INFO ] Proved 244 variables to be positive in 2489 ms
[2020-05-21 01:03:13] [INFO ] Computing symmetric may disable matrix : 332 transitions.
[2020-05-21 01:03:13] [INFO ] Computation of disable matrix completed :0/332 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:03:13] [INFO ] Computation of Complete disable matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:03:13] [INFO ] Computing symmetric may enable matrix : 332 transitions.
[2020-05-21 01:03:13] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:03:33] [INFO ] Computing symmetric co enabling matrix : 332 transitions.
[2020-05-21 01:03:35] [INFO ] Computation of co-enabling matrix(0/332) took 1477 ms. Total solver calls (SAT/UNSAT): 100(9/91)
[2020-05-21 01:03:39] [INFO ] Computation of co-enabling matrix(5/332) took 5612 ms. Total solver calls (SAT/UNSAT): 526(18/508)
[2020-05-21 01:03:43] [INFO ] Computation of co-enabling matrix(8/332) took 9191 ms. Total solver calls (SAT/UNSAT): 803(36/767)
[2020-05-21 01:03:46] [INFO ] Computation of co-enabling matrix(12/332) took 12215 ms. Total solver calls (SAT/UNSAT): 1158(54/1104)
[2020-05-21 01:03:50] [INFO ] Computation of co-enabling matrix(17/332) took 16108 ms. Total solver calls (SAT/UNSAT): 1586(72/1514)
[2020-05-21 01:03:53] [INFO ] Computation of co-enabling matrix(21/332) took 19622 ms. Total solver calls (SAT/UNSAT): 1932(90/1842)
[2020-05-21 01:03:56] [INFO ] Computation of co-enabling matrix(24/332) took 22875 ms. Total solver calls (SAT/UNSAT): 2189(108/2081)
[2020-05-21 01:04:00] [INFO ] Computation of co-enabling matrix(26/332) took 26108 ms. Total solver calls (SAT/UNSAT): 2378(126/2252)
[2020-05-21 01:04:03] [INFO ] Computation of co-enabling matrix(32/332) took 30026 ms. Total solver calls (SAT/UNSAT): 2883(153/2730)
[2020-05-21 01:04:07] [INFO ] Computation of co-enabling matrix(34/332) took 33822 ms. Total solver calls (SAT/UNSAT): 3048(162/2886)
[2020-05-21 01:04:11] [INFO ] Computation of co-enabling matrix(37/332) took 37466 ms. Total solver calls (SAT/UNSAT): 3352(191/3161)
[2020-05-21 01:04:14] [INFO ] Computation of co-enabling matrix(41/332) took 40498 ms. Total solver calls (SAT/UNSAT): 3682(204/3478)
[2020-05-21 01:04:17] [INFO ] Computation of co-enabling matrix(44/332) took 43623 ms. Total solver calls (SAT/UNSAT): 3933(222/3711)
[2020-05-21 01:04:21] [INFO ] Computation of co-enabling matrix(47/332) took 47197 ms. Total solver calls (SAT/UNSAT): 4163(231/3932)
[2020-05-21 01:04:24] [INFO ] Computation of co-enabling matrix(51/332) took 50941 ms. Total solver calls (SAT/UNSAT): 4477(249/4228)
Reverse transition relation is NOT exact ! Due to transitions gu0.EndLoop_3_1, gu0.EndLoop_1_1, gu0.EndLoop_2_1, gu0.EndLoop_3_0, gu0.EndLoop_0_1, gu0.EndLoop_1_0, gu0.EndLoop_2_0, gu0.EndLoop_0_0, BecomeIdle_0, BecomeIdle_1, BecomeIdle_2, BecomeIdle_3, NotAlone_2_3_0, NotAlone_1_3_0, NotAlone_0_3_0, NotAlone_3_2_0, NotAlone_1_2_0, NotAlone_0_2_0, NotAlone_3_1_0, NotAlone_3_2_1, NotAlone_1_2_1, NotAlone_0_2_1, NotAlone_3_1_1, NotAlone_2_1_1, NotAlone_2_1_0, NotAlone_2_1_2, NotAlone_0_3_1, NotAlone_1_3_1, NotAlone_2_3_1, NotAlone_0_3_2, NotAlone_1_3_2, NotAlone_2_3_2, NotAlone_3_1_2, NotAlone_0_2_2, NotAlone_1_2_2, NotAlone_3_2_2, UpdateTurn_3_2_0, UpdateTurn_2_1_0, UpdateTurn_0_1_0, UpdateTurn_1_2_2, UpdateTurn_2_1_2, UpdateTurn_3_0_2, UpdateTurn_0_1_2, UpdateTurn_1_3_1, UpdateTurn_2_2_1, UpdateTurn_1_2_1, UpdateTurn_3_2_1, UpdateTurn_0_2_1, UpdateTurn_3_1_1, UpdateTurn_2_0_1, UpdateTurn_1_3_0, UpdateTurn_0_0_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/227/52/279
[2020-05-21 01:04:29] [INFO ] Computation of co-enabling matrix(54/332) took 55526 ms. Total solver calls (SAT/UNSAT): 4740(276/4464)
[2020-05-21 01:04:33] [INFO ] Computation of co-enabling matrix(57/332) took 59879 ms. Total solver calls (SAT/UNSAT): 4981(294/4687)
[2020-05-21 01:04:38] [INFO ] Computation of co-enabling matrix(63/332) took 64120 ms. Total solver calls (SAT/UNSAT): 5422(312/5110)
[2020-05-21 01:04:42] [INFO ] Computation of co-enabling matrix(67/332) took 68530 ms. Total solver calls (SAT/UNSAT): 5748(348/5400)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9355 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,93.6592,1636968,1,0,654,6.63562e+06,588,315,7652,6.523e+06,837
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-PT-3-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(!(G(((X(X("((((gu2.Idle_3+gu2.Idle_2)+gu2.Idle_1)+gu2.Idle_0)>=2)")))&&("((((((((((((gu0.EndTurn_0_0+gu0.EndTurn_0_1)+gu0.EndTurn_3_0)+gu0.EndTurn_2_0)+gu0.EndTurn_1_0)+gu0.EndTurn_0_2)+gu0.EndTurn_3_1)+gu0.EndTurn_2_1)+gu0.EndTurn_1_1)+gu0.EndTurn_3_2)+gu0.EndTurn_2_2)+gu0.EndTurn_1_2)<=(((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3))"))&&(F("((((gu2.Idle_3+gu2.Idle_2)+gu2.Idle_1)+gu2.Idle_0)>=2)"))))))))
Formula 1 simplified : !GX!G("((((((((((((gu0.EndTurn_0_0+gu0.EndTurn_0_1)+gu0.EndTurn_3_0)+gu0.EndTurn_2_0)+gu0.EndTurn_1_0)+gu0.EndTurn_0_2)+gu0.EndTurn_3_1)+gu0.EndTurn_2_1)+gu0.EndTurn_1_1)+gu0.EndTurn_3_2)+gu0.EndTurn_2_2)+gu0.EndTurn_1_2)<=(((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3))" & XX"((((gu2.Idle_3+gu2.Idle_2)+gu2.Idle_1)+gu2.Idle_0)>=2)" & F"((((gu2.Idle_3+gu2.Idle_2)+gu2.Idle_1)+gu2.Idle_0)>=2)")
[2020-05-21 01:04:46] [INFO ] Computation of co-enabling matrix(71/332) took 72281 ms. Total solver calls (SAT/UNSAT): 6044(366/5678)
[2020-05-21 01:04:50] [INFO ] Computation of co-enabling matrix(77/332) took 76747 ms. Total solver calls (SAT/UNSAT): 6463(384/6079)
[2020-05-21 01:04:54] [INFO ] Computation of co-enabling matrix(81/332) took 80513 ms. Total solver calls (SAT/UNSAT): 6749(402/6347)
[2020-05-21 01:04:57] [INFO ] Computation of co-enabling matrix(84/332) took 83542 ms. Total solver calls (SAT/UNSAT): 6952(411/6541)
[2020-05-21 01:05:01] [INFO ] Computation of co-enabling matrix(87/332) took 87831 ms. Total solver calls (SAT/UNSAT): 7171(429/6742)
[2020-05-21 01:05:04] [INFO ] Computation of co-enabling matrix(89/332) took 90899 ms. Total solver calls (SAT/UNSAT): 7309(438/6871)
[2020-05-21 01:05:08] [INFO ] Computation of co-enabling matrix(92/332) took 94368 ms. Total solver calls (SAT/UNSAT): 7524(456/7068)
[2020-05-21 01:05:11] [INFO ] Computation of co-enabling matrix(95/332) took 97854 ms. Total solver calls (SAT/UNSAT): 7719(465/7254)
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2697 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,120.652,2175348,1,0,696,8.08318e+06,606,316,8780,9.07925e+06,958
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-PT-3-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(G(("((((((((((((((((((((((((((((((((((((((((((((((((gu1.BeginLoop_0_0_0+gu1.BeginLoop_1_1_0)+gu1.BeginLoop_2_1_0)+gu1.BeginLoop_3_1_0)+gu1.BeginLoop_0_2_0)+gu1.BeginLoop_1_0_0)+gu1.BeginLoop_2_0_0)+gu1.BeginLoop_3_0_0)+gu1.BeginLoop_0_1_0)+gu1.BeginLoop_1_0_1)+gu1.BeginLoop_2_0_1)+gu1.BeginLoop_3_0_1)+gu1.BeginLoop_0_1_1)+gu1.BeginLoop_1_2_0)+gu1.BeginLoop_2_2_0)+gu1.BeginLoop_3_2_0)+gu1.BeginLoop_0_0_1)+gu1.BeginLoop_2_2_1)+gu1.BeginLoop_1_2_1)+gu1.BeginLoop_0_0_2)+gu1.BeginLoop_3_2_1)+gu1.BeginLoop_2_1_1)+gu1.BeginLoop_1_1_1)+gu1.BeginLoop_0_2_1)+gu1.BeginLoop_3_1_1)+gu1.BeginLoop_2_1_2)+gu1.BeginLoop_1_1_2)+gu1.BeginLoop_0_2_2)+gu1.BeginLoop_3_1_2)+gu1.BeginLoop_2_0_2)+gu1.BeginLoop_1_0_2)+gu1.BeginLoop_0_1_2)+gu1.BeginLoop_3_0_2)+gu1.BeginLoop_3_0_3)+gu1.BeginLoop_0_1_3)+gu1.BeginLoop_1_0_3)+gu1.BeginLoop_2_0_3)+gu1.BeginLoop_3_2_2)+gu1.BeginLoop_0_0_3)+gu1.BeginLoop_1_2_2)+gu1.BeginLoop_2_2_2)+gu1.BeginLoop_3_2_3)+gu1.BeginLoop_1_2_3)+gu1.BeginLoop_2_2_3)+gu1.BeginLoop_3_1_3)+gu1.BeginLoop_0_2_3)+gu1.BeginLoop_1_1_3)+gu1.BeginLoop_2_1_3)>=1)")U("((((gu4.CS_3+gu4.CS_1)+gu4.CS_2)+gu4.CS_0)>=1)"))))))
Formula 2 simplified : !GFG("((((((((((((((((((((((((((((((((((((((((((((((((gu1.BeginLoop_0_0_0+gu1.BeginLoop_1_1_0)+gu1.BeginLoop_2_1_0)+gu1.BeginLoop_3_1_0)+gu1.BeginLoop_0_2_0)+gu1.BeginLoop_1_0_0)+gu1.BeginLoop_2_0_0)+gu1.BeginLoop_3_0_0)+gu1.BeginLoop_0_1_0)+gu1.BeginLoop_1_0_1)+gu1.BeginLoop_2_0_1)+gu1.BeginLoop_3_0_1)+gu1.BeginLoop_0_1_1)+gu1.BeginLoop_1_2_0)+gu1.BeginLoop_2_2_0)+gu1.BeginLoop_3_2_0)+gu1.BeginLoop_0_0_1)+gu1.BeginLoop_2_2_1)+gu1.BeginLoop_1_2_1)+gu1.BeginLoop_0_0_2)+gu1.BeginLoop_3_2_1)+gu1.BeginLoop_2_1_1)+gu1.BeginLoop_1_1_1)+gu1.BeginLoop_0_2_1)+gu1.BeginLoop_3_1_1)+gu1.BeginLoop_2_1_2)+gu1.BeginLoop_1_1_2)+gu1.BeginLoop_0_2_2)+gu1.BeginLoop_3_1_2)+gu1.BeginLoop_2_0_2)+gu1.BeginLoop_1_0_2)+gu1.BeginLoop_0_1_2)+gu1.BeginLoop_3_0_2)+gu1.BeginLoop_3_0_3)+gu1.BeginLoop_0_1_3)+gu1.BeginLoop_1_0_3)+gu1.BeginLoop_2_0_3)+gu1.BeginLoop_3_2_2)+gu1.BeginLoop_0_0_3)+gu1.BeginLoop_1_2_2)+gu1.BeginLoop_2_2_2)+gu1.BeginLoop_3_2_3)+gu1.BeginLoop_1_2_3)+gu1.BeginLoop_2_2_3)+gu1.BeginLoop_3_1_3)+gu1.BeginLoop_0_2_3)+gu1.BeginLoop_1_1_3)+gu1.BeginLoop_2_1_3)>=1)" U "((((gu4.CS_3+gu4.CS_1)+gu4.CS_2)+gu4.CS_0)>=1)")
[2020-05-21 01:05:16] [INFO ] Computation of co-enabling matrix(100/332) took 102174 ms. Total solver calls (SAT/UNSAT): 8062(492/7570)
[2020-05-21 01:05:20] [INFO ] Computation of co-enabling matrix(103/332) took 106730 ms. Total solver calls (SAT/UNSAT): 8251(501/7750)
[2020-05-21 01:05:24] [INFO ] Computation of co-enabling matrix(106/332) took 110573 ms. Total solver calls (SAT/UNSAT): 8437(510/7927)
[2020-05-21 01:05:27] [INFO ] Computation of co-enabling matrix(108/332) took 113761 ms. Total solver calls (SAT/UNSAT): 8628(527/8101)
[2020-05-21 01:05:33] [INFO ] Computation of co-enabling matrix(111/332) took 119390 ms. Total solver calls (SAT/UNSAT): 8932(554/8378)
[2020-05-21 01:05:36] [INFO ] Computation of co-enabling matrix(113/332) took 123005 ms. Total solver calls (SAT/UNSAT): 9085(585/8500)
[2020-05-21 01:05:41] [INFO ] Computation of co-enabling matrix(117/332) took 127632 ms. Total solver calls (SAT/UNSAT): 9409(632/8777)
[2020-05-21 01:05:45] [INFO ] Computation of co-enabling matrix(119/332) took 131964 ms. Total solver calls (SAT/UNSAT): 9640(651/8989)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3379 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,154.452,2215476,1,0,696,8.15198e+06,27,316,6262,9.19265e+06,26
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-3-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F(!(F("((((gu4.CS_3+gu4.CS_1)+gu4.CS_2)+gu4.CS_0)<=(((((((((((((((((((((((((((((((((((gu4.TestAlone_1_0_0+gu4.TestAlone_3_2_0)+gu4.TestAlone_2_2_0)+gu4.TestAlone_1_2_0)+gu4.TestAlone_3_1_0)+gu4.TestAlone_2_1_0)+gu4.TestAlone_1_1_0)+gu4.TestAlone_3_0_0)+gu4.TestAlone_2_0_0)+gu4.TestAlone_0_0_2)+gu4.TestAlone_3_2_1)+gu4.TestAlone_3_0_2)+gu4.TestAlone_1_0_2)+gu4.TestAlone_1_1_2)+gu4.TestAlone_0_1_2)+gu4.TestAlone_0_2_2)+gu4.TestAlone_3_1_2)+gu4.TestAlone_2_0_1)+gu4.TestAlone_0_0_1)+gu4.TestAlone_0_1_1)+gu4.TestAlone_3_0_1)+gu4.TestAlone_3_1_1)+gu4.TestAlone_2_1_1)+gu4.TestAlone_2_2_1)+gu4.TestAlone_0_2_1)+gu4.TestAlone_0_2_3)+gu4.TestAlone_1_2_3)+gu4.TestAlone_2_2_3)+gu4.TestAlone_1_2_2)+gu4.TestAlone_3_2_2)+gu4.TestAlone_0_0_3)+gu4.TestAlone_1_0_3)+gu4.TestAlone_2_0_3)+gu4.TestAlone_0_1_3)+gu4.TestAlone_1_1_3)+gu4.TestAlone_2_1_3))"))))&&(F("((((((((((((((((((((((((((((((((((((((((((((((((gu3.TestIdentity_0_1_0+gu3.TestIdentity_3_0_0)+gu3.TestIdentity_2_0_0)+gu3.TestIdentity_1_0_0)+gu3.TestIdentity_0_2_0)+gu3.TestIdentity_3_1_0)+gu3.TestIdentity_2_1_0)+gu3.TestIdentity_1_1_0)+gu3.TestIdentity_0_0_0)+gu3.TestIdentity_3_1_1)+gu3.TestIdentity_0_2_1)+gu3.TestIdentity_1_1_1)+gu3.TestIdentity_2_1_1)+gu3.TestIdentity_3_2_1)+gu3.TestIdentity_0_0_2)+gu3.TestIdentity_1_2_1)+gu3.TestIdentity_2_2_1)+gu3.TestIdentity_3_2_0)+gu3.TestIdentity_0_0_1)+gu3.TestIdentity_1_2_0)+gu3.TestIdentity_2_2_0)+gu3.TestIdentity_3_0_1)+gu3.TestIdentity_0_1_1)+gu3.TestIdentity_1_0_1)+gu3.TestIdentity_2_0_1)+gu3.TestIdentity_2_0_3)+gu3.TestIdentity_1_0_3)+gu3.TestIdentity_0_1_3)+gu3.TestIdentity_3_0_3)+gu3.TestIdentity_2_2_2)+gu3.TestIdentity_1_2_2)+gu3.TestIdentity_0_0_3)+gu3.TestIdentity_3_2_2)+gu3.TestIdentity_2_1_2)+gu3.TestIdentity_1_1_2)+gu3.TestIdentity_0_2_2)+gu3.TestIdentity_3_1_2)+gu3.TestIdentity_2_0_2)+gu3.TestIdentity_1_0_2)+gu3.TestIdentity_0_1_2)+gu3.TestIdentity_3_0_2)+gu3.TestIdentity_1_2_3)+gu3.TestIdentity_2_2_3)+gu3.TestIdentity_3_2_3)+gu3.TestIdentity_1_1_3)+gu3.TestIdentity_2_1_3)+gu3.TestIdentity_3_1_3)+gu3.TestIdentity_0_2_3)>=2)")))))
Formula 3 simplified : !G(F!F"((((gu4.CS_3+gu4.CS_1)+gu4.CS_2)+gu4.CS_0)<=(((((((((((((((((((((((((((((((((((gu4.TestAlone_1_0_0+gu4.TestAlone_3_2_0)+gu4.TestAlone_2_2_0)+gu4.TestAlone_1_2_0)+gu4.TestAlone_3_1_0)+gu4.TestAlone_2_1_0)+gu4.TestAlone_1_1_0)+gu4.TestAlone_3_0_0)+gu4.TestAlone_2_0_0)+gu4.TestAlone_0_0_2)+gu4.TestAlone_3_2_1)+gu4.TestAlone_3_0_2)+gu4.TestAlone_1_0_2)+gu4.TestAlone_1_1_2)+gu4.TestAlone_0_1_2)+gu4.TestAlone_0_2_2)+gu4.TestAlone_3_1_2)+gu4.TestAlone_2_0_1)+gu4.TestAlone_0_0_1)+gu4.TestAlone_0_1_1)+gu4.TestAlone_3_0_1)+gu4.TestAlone_3_1_1)+gu4.TestAlone_2_1_1)+gu4.TestAlone_2_2_1)+gu4.TestAlone_0_2_1)+gu4.TestAlone_0_2_3)+gu4.TestAlone_1_2_3)+gu4.TestAlone_2_2_3)+gu4.TestAlone_1_2_2)+gu4.TestAlone_3_2_2)+gu4.TestAlone_0_0_3)+gu4.TestAlone_1_0_3)+gu4.TestAlone_2_0_3)+gu4.TestAlone_0_1_3)+gu4.TestAlone_1_1_3)+gu4.TestAlone_2_1_3))" & F"((((((((((((((((((((((((((((((((((((((((((((((((gu3.TestIdentity_0_1_0+gu3.TestIdentity_3_0_0)+gu3.TestIdentity_2_0_0)+gu3.TestIdentity_1_0_0)+gu3.TestIdentity_0_2_0)+gu3.TestIdentity_3_1_0)+gu3.TestIdentity_2_1_0)+gu3.TestIdentity_1_1_0)+gu3.TestIdentity_0_0_0)+gu3.TestIdentity_3_1_1)+gu3.TestIdentity_0_2_1)+gu3.TestIdentity_1_1_1)+gu3.TestIdentity_2_1_1)+gu3.TestIdentity_3_2_1)+gu3.TestIdentity_0_0_2)+gu3.TestIdentity_1_2_1)+gu3.TestIdentity_2_2_1)+gu3.TestIdentity_3_2_0)+gu3.TestIdentity_0_0_1)+gu3.TestIdentity_1_2_0)+gu3.TestIdentity_2_2_0)+gu3.TestIdentity_3_0_1)+gu3.TestIdentity_0_1_1)+gu3.TestIdentity_1_0_1)+gu3.TestIdentity_2_0_1)+gu3.TestIdentity_2_0_3)+gu3.TestIdentity_1_0_3)+gu3.TestIdentity_0_1_3)+gu3.TestIdentity_3_0_3)+gu3.TestIdentity_2_2_2)+gu3.TestIdentity_1_2_2)+gu3.TestIdentity_0_0_3)+gu3.TestIdentity_3_2_2)+gu3.TestIdentity_2_1_2)+gu3.TestIdentity_1_1_2)+gu3.TestIdentity_0_2_2)+gu3.TestIdentity_3_1_2)+gu3.TestIdentity_2_0_2)+gu3.TestIdentity_1_0_2)+gu3.TestIdentity_0_1_2)+gu3.TestIdentity_3_0_2)+gu3.TestIdentity_1_2_3)+gu3.TestIdentity_2_2_3)+gu3.TestIdentity_3_2_3)+gu3.TestIdentity_1_1_3)+gu3.TestIdentity_2_1_3)+gu3.TestIdentity_3_1_3)+gu3.TestIdentity_0_2_3)>=2)")
[2020-05-21 01:05:49] [INFO ] Computation of co-enabling matrix(122/332) took 135437 ms. Total solver calls (SAT/UNSAT): 9913(668/9245)
[2020-05-21 01:05:52] [INFO ] Computation of co-enabling matrix(124/332) took 138528 ms. Total solver calls (SAT/UNSAT): 10080(678/9402)
[2020-05-21 01:05:55] [INFO ] Computation of co-enabling matrix(127/332) took 141845 ms. Total solver calls (SAT/UNSAT): 10261(696/9565)
[2020-05-21 01:05:59] [INFO ] Computation of co-enabling matrix(131/332) took 145350 ms. Total solver calls (SAT/UNSAT): 10491(720/9771)
[2020-05-21 01:06:03] [INFO ] Computation of co-enabling matrix(135/332) took 149531 ms. Total solver calls (SAT/UNSAT): 10744(765/9979)
[2020-05-21 01:06:08] [INFO ] Computation of co-enabling matrix(139/332) took 154679 ms. Total solver calls (SAT/UNSAT): 11113(799/10314)
[2020-05-21 01:06:15] [INFO ] Computation of co-enabling matrix(141/332) took 161976 ms. Total solver calls (SAT/UNSAT): 11274(863/10411)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3207 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,186.532,2215704,1,0,696,8.15198e+06,44,316,9007,9.19265e+06,59
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-PT-3-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(("(gu0.EndTurn_1_0<=gu0.WantSection_3_F)")U((!(G(F(("(gu1.BeginLoop_3_2_3<=gu0.IsEndLoop_1_0_1)")U(X("(gu1.BeginLoop_3_2_3<=gu0.IsEndLoop_1_0_1)"))))))||(!(X("(gu4.TestAlone_0_1_1<=gu0.EndTurn_2_2)")))))))
Formula 4 simplified : !F("(gu0.EndTurn_1_0<=gu0.WantSection_3_F)" U (!GF("(gu1.BeginLoop_3_2_3<=gu0.IsEndLoop_1_0_1)" U X"(gu1.BeginLoop_3_2_3<=gu0.IsEndLoop_1_0_1)") | !X"(gu4.TestAlone_0_1_1<=gu0.EndTurn_2_2)"))
[2020-05-21 01:06:21] [INFO ] Computation of co-enabling matrix(142/332) took 167683 ms. Total solver calls (SAT/UNSAT): 11371(915/10456)
[2020-05-21 01:06:28] [INFO ] Computation of co-enabling matrix(144/332) took 174826 ms. Total solver calls (SAT/UNSAT): 11575(1021/10554)
[2020-05-21 01:06:33] [INFO ] Computation of co-enabling matrix(145/332) took 180066 ms. Total solver calls (SAT/UNSAT): 11670(1072/10598)
[2020-05-21 01:06:37] [INFO ] Computation of co-enabling matrix(147/332) took 183524 ms. Total solver calls (SAT/UNSAT): 11829(1134/10695)
[2020-05-21 01:06:43] [INFO ] Computation of co-enabling matrix(148/332) took 189809 ms. Total solver calls (SAT/UNSAT): 11930(1187/10743)
[2020-05-21 01:06:48] [INFO ] Computation of co-enabling matrix(149/332) took 194602 ms. Total solver calls (SAT/UNSAT): 12022(1236/10786)
[2020-05-21 01:06:51] [INFO ] Computation of co-enabling matrix(152/332) took 197646 ms. Total solver calls (SAT/UNSAT): 12233(1303/10930)
[2020-05-21 01:06:55] [INFO ] Computation of co-enabling matrix(155/332) took 201174 ms. Total solver calls (SAT/UNSAT): 12396(1324/11072)
[2020-05-21 01:06:59] [INFO ] Computation of co-enabling matrix(157/332) took 205573 ms. Total solver calls (SAT/UNSAT): 12579(1335/11244)
[2020-05-21 01:07:02] [INFO ] Computation of co-enabling matrix(161/332) took 208670 ms. Total solver calls (SAT/UNSAT): 12814(1355/11459)
[2020-05-21 01:07:06] [INFO ] Computation of co-enabling matrix(165/332) took 212722 ms. Total solver calls (SAT/UNSAT): 13006(1377/11629)
[2020-05-21 01:07:09] [INFO ] Computation of co-enabling matrix(169/332) took 215905 ms. Total solver calls (SAT/UNSAT): 13234(1401/11833)
[2020-05-21 01:07:13] [INFO ] Computation of co-enabling matrix(175/332) took 219364 ms. Total solver calls (SAT/UNSAT): 13559(1415/12144)
[2020-05-21 01:07:16] [INFO ] Computation of co-enabling matrix(188/332) took 222575 ms. Total solver calls (SAT/UNSAT): 14071(1447/12624)
[2020-05-21 01:07:20] [INFO ] Computation of co-enabling matrix(192/332) took 226276 ms. Total solver calls (SAT/UNSAT): 14263(1497/12766)
[2020-05-21 01:07:24] [INFO ] Computation of co-enabling matrix(193/332) took 230301 ms. Total solver calls (SAT/UNSAT): 14334(1533/12801)
[2020-05-21 01:07:28] [INFO ] Computation of co-enabling matrix(194/332) took 235009 ms. Total solver calls (SAT/UNSAT): 14404(1570/12834)
[2020-05-21 01:07:34] [INFO ] Computation of co-enabling matrix(197/332) took 240377 ms. Total solver calls (SAT/UNSAT): 14575(1639/12936)
[2020-05-21 01:07:38] [INFO ] Computation of co-enabling matrix(198/332) took 244489 ms. Total solver calls (SAT/UNSAT): 14642(1674/12968)
[2020-05-21 01:07:43] [INFO ] Computation of co-enabling matrix(202/332) took 249388 ms. Total solver calls (SAT/UNSAT): 14838(1739/13099)
[2020-05-21 01:07:46] [INFO ] Computation of co-enabling matrix(203/332) took 252659 ms. Total solver calls (SAT/UNSAT): 14901(1770/13131)
[2020-05-21 01:07:49] [INFO ] Computation of co-enabling matrix(219/332) took 255746 ms. Total solver calls (SAT/UNSAT): 15396(1776/13620)
[2020-05-21 01:07:53] [INFO ] Computation of co-enabling matrix(236/332) took 259241 ms. Total solver calls (SAT/UNSAT): 15849(1782/14067)
[2020-05-21 01:07:56] [INFO ] Computation of co-enabling matrix(242/332) took 262549 ms. Total solver calls (SAT/UNSAT): 16097(1813/14284)
[2020-05-21 01:07:59] [INFO ] Computation of co-enabling matrix(246/332) took 266034 ms. Total solver calls (SAT/UNSAT): 16267(1834/14433)
[2020-05-21 01:08:03] [INFO ] Computation of co-enabling matrix(253/332) took 269216 ms. Total solver calls (SAT/UNSAT): 16547(1868/14679)
[2020-05-21 01:08:07] [INFO ] Computation of co-enabling matrix(260/332) took 273086 ms. Total solver calls (SAT/UNSAT): 16800(1901/14899)
[2020-05-21 01:08:10] [INFO ] Computation of co-enabling matrix(267/332) took 276222 ms. Total solver calls (SAT/UNSAT): 17038(1935/15103)
[2020-05-21 01:08:13] [INFO ] Computation of co-enabling matrix(274/332) took 279300 ms. Total solver calls (SAT/UNSAT): 17227(1954/15273)
[2020-05-21 01:08:16] [INFO ] Computation of co-enabling matrix(286/332) took 282658 ms. Total solver calls (SAT/UNSAT): 17449(1973/15476)
[2020-05-21 01:08:19] [INFO ] Computation of co-enabling matrix(297/332) took 286033 ms. Total solver calls (SAT/UNSAT): 17658(1996/15662)
[2020-05-21 01:08:23] [INFO ] Computation of co-enabling matrix(308/332) took 289486 ms. Total solver calls (SAT/UNSAT): 17809(2013/15796)
[2020-05-21 01:08:26] [INFO ] Computation of co-enabling matrix(321/332) took 292692 ms. Total solver calls (SAT/UNSAT): 17940(2033/15907)
[2020-05-21 01:08:28] [INFO ] Computation of Finished co-enabling matrix. took 294411 ms. Total solver calls (SAT/UNSAT): 17968(2043/15925)
[2020-05-21 01:08:28] [INFO ] Computing Do-Not-Accords matrix : 332 transitions.
[2020-05-21 01:08:28] [INFO ] Computation of Completed DNA matrix. took 108 ms. Total solver calls (SAT/UNSAT): 36(0/36)
[2020-05-21 01:08:28] [INFO ] Built C files in 318216ms 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 4639 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 84 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(((LTLAP9==true))U(( !( [](<>(((LTLAP10==true))U(X((LTLAP10==true)))))) ) || ( !( X((LTLAP11==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, <>(((LTLAP9==true))U(( !( [](<>(((LTLAP10==true))U(X((LTLAP10==true)))))) ) || ( !( X((LTLAP11==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, <>(((LTLAP9==true))U(( !( [](<>(((LTLAP10==true))U(X((LTLAP10==true)))))) ) || ( !( X((LTLAP11==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)
42 unique states visited
42 strongly connected components in search stack
42 transitions explored
42 items max in DFS search stack
14843 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,334.97,2533672,1,0,696,1.0482e+07,18,316,3810,1.36441e+07,916
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-PT-3-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F(!(F((G("(gu3.WantSection_3_T<=gu3.TestIdentity_3_0_3)"))U("(gu3.TestIdentity_1_2_2<=gu2.Idle_2)")))))&&(G("(gu0.IsEndLoop_2_0_2<=gu3.TestIdentity_3_2_0)")))))
Formula 5 simplified : !X(F!F(G"(gu3.WantSection_3_T<=gu3.TestIdentity_3_0_3)" U "(gu3.TestIdentity_1_2_2<=gu2.Idle_2)") & G"(gu0.IsEndLoop_2_0_2<=gu3.TestIdentity_3_2_0)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
20491 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,539.891,3235280,1,0,696,1.23421e+07,22,316,3817,1.77361e+07,252
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-PT-3-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((X((G("(gu2.Idle_2<=gu2.TestTurn_2_1)"))U("(gu3.TestIdentity_1_2_0<=gu2.Idle_1)")))||(G(X("(gu2.Idle_2<=gu2.TestTurn_2_1)"))))||(X(F("(gu3.TestIdentity_1_0_3>=1)")))))
Formula 6 simplified : !(X(G"(gu2.Idle_2<=gu2.TestTurn_2_1)" U "(gu3.TestIdentity_1_2_0<=gu2.Idle_1)") | GX"(gu2.Idle_2<=gu2.TestTurn_2_1)" | XF"(gu3.TestIdentity_1_0_3>=1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1055 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,550.442,3235464,1,0,696,1.23421e+07,37,316,4603,1.77361e+07,263
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Peterson-PT-3-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!((X(((G("(gu4.CS_2<=gu1.BeginLoop_3_0_0)"))&&("(gu1.BeginLoop_0_2_2>=1)"))||("(gu4.CS_2>gu1.BeginLoop_3_0_0)")))U("(gu1.BeginLoop_0_2_2>=1)"))))
Formula 7 simplified : X("(gu4.CS_2>gu1.BeginLoop_3_0_0)" | ("(gu1.BeginLoop_0_2_2>=1)" & G"(gu4.CS_2<=gu1.BeginLoop_3_0_0)")) U "(gu1.BeginLoop_0_2_2>=1)"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,550.446,3235464,1,0,696,1.23421e+07,58,316,4618,1.77361e+07,274
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Peterson-PT-3-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X((G("(gu4.CS_2<=gu1.BeginLoop_3_2_2)"))||("(gu0.IsEndLoop_2_0_0<=gu3.TestIdentity_1_0_0)")))U(F(G("(gu0.IsEndLoop_2_0_0<=gu3.TestIdentity_1_0_0)")))))
Formula 8 simplified : !(X("(gu0.IsEndLoop_2_0_0<=gu3.TestIdentity_1_0_0)" | G"(gu4.CS_2<=gu1.BeginLoop_3_2_2)") U FG"(gu0.IsEndLoop_2_0_0<=gu3.TestIdentity_1_0_0)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
37735 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,927.803,3962880,1,0,722,1.47256e+07,18,316,3816,2.4951e+07,929
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-PT-3-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(("((gu0.IsEndLoop_3_1_0>=1)||(gu4.TestAlone_2_0_1<=gu0.EndTurn_2_0))")U(F("(gu4.Turn_1_2<=gu4.TestAlone_1_2_0)"))))||(!(X("(gu2.Idle_0<=gu2.TestTurn_3_1)")))))
Formula 9 simplified : !(!("((gu0.IsEndLoop_3_1_0>=1)||(gu4.TestAlone_2_0_1<=gu0.EndTurn_2_0))" U F"(gu4.Turn_1_2<=gu4.TestAlone_1_2_0)") | !X"(gu2.Idle_0<=gu2.TestTurn_3_1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2850 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,956.304,3962880,1,0,722,1.47256e+07,33,316,5021,2.4951e+07,955
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-PT-3-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(X(F(!(F(G("(gu0.AskForSection_3_0<=gu0.WantSection_2_F)")))))))))
Formula 10 simplified : !XXXF!FG"(gu0.AskForSection_3_0<=gu0.WantSection_2_F)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
205 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,958.363,3962880,1,0,722,1.47256e+07,42,316,5026,2.4951e+07,966
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-PT-3-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1590023989747

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Peterson-PT-3"
export BK_EXAMINATION="LTLCardinality"
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 Peterson-PT-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258000713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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