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-158961258000714.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000714
=====================================================================

--------------------
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 1590022958208

[2020-05-21 01:02:41] [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-21 01:02:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:02:41] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2020-05-21 01:02:41] [INFO ] Transformed 244 places.
[2020-05-21 01:02:41] [INFO ] Transformed 332 transitions.
[2020-05-21 01:02:41] [INFO ] Parsed PT model containing 244 places and 332 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 487 ms. (steps per millisecond=205 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1]
[2020-05-21 01:02:42] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:02:42] [INFO ] Computed 15 place invariants in 13 ms
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive place invariants in 68 ms returned sat
[2020-05-21 01:02:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 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 781 ms returned sat
[2020-05-21 01:02:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-21 01:02:43] [INFO ] [Real]Added 66 Read/Feed constraints in 15 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 19 ms returned sat
[2020-05-21 01:02:43] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:44] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2020-05-21 01:02:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:02:44] [INFO ] Deduced a trap composed of 9 places in 189 ms
[2020-05-21 01:02:44] [INFO ] Deduced a trap composed of 13 places in 97 ms
[2020-05-21 01:02:44] [INFO ] Deduced a trap composed of 49 places in 74 ms
[2020-05-21 01:02:44] [INFO ] Deduced a trap composed of 52 places in 75 ms
[2020-05-21 01:02:45] [INFO ] Deduced a trap composed of 49 places in 975 ms
[2020-05-21 01:02:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1563 ms
[2020-05-21 01:02:45] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 37 ms.
[2020-05-21 01:02:48] [INFO ] Added : 304 causal constraints over 61 iterations in 2545 ms. Result :sat
[2020-05-21 01:02:48] [INFO ] Deduced a trap composed of 12 places in 197 ms
[2020-05-21 01:02:48] [INFO ] Deduced a trap composed of 9 places in 142 ms
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 30 places in 555 ms
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 48 places in 102 ms
[2020-05-21 01:02:49] [INFO ] Deduced a trap composed of 26 places in 137 ms
[2020-05-21 01:02:50] [INFO ] Deduced a trap composed of 26 places in 1126 ms
[2020-05-21 01:02:51] [INFO ] Deduced a trap composed of 31 places in 599 ms
[2020-05-21 01:02:52] [INFO ] Deduced a trap composed of 27 places in 617 ms
[2020-05-21 01:02:52] [INFO ] Deduced a trap composed of 18 places in 326 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 48 places in 1957 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 45 places in 831 ms
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 39 places in 1013 ms
[2020-05-21 01:02:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 8263 ms
[2020-05-21 01:02:56] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:57] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2020-05-21 01:02:57] [INFO ] [Real]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:02:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-21 01:02:57] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:57] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2020-05-21 01:02:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 42 ms returned sat
[2020-05-21 01:02:58] [INFO ] Deduced a trap composed of 9 places in 286 ms
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 21 places in 2742 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 52 places in 989 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 39 places in 157 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 34 places in 173 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 50 places in 426 ms
[2020-05-21 01:03:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4908 ms
[2020-05-21 01:03:02] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 46 ms.
[2020-05-21 01:03:05] [INFO ] Added : 303 causal constraints over 61 iterations in 2347 ms. Result :sat
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 9 places in 1006 ms
[2020-05-21 01:03:08] [INFO ] Deduced a trap composed of 16 places in 1729 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 37 places in 1549 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 17 places in 2075 ms
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 16 places in 2368 ms
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 34 places in 333 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 56 places in 563 ms
[2020-05-21 01:03:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 10108 ms
[2020-05-21 01:03:15] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:03:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:16] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Real]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-21 01:03:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 23 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:16] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:03:17] [INFO ] Deduced a trap composed of 9 places in 817 ms
[2020-05-21 01:03:19] [INFO ] Deduced a trap composed of 31 places in 1521 ms
[2020-05-21 01:03:22] [INFO ] Deduced a trap composed of 49 places in 2799 ms
[2020-05-21 01:03:22] [INFO ] Deduced a trap composed of 31 places in 681 ms
[2020-05-21 01:03:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5976 ms
[2020-05-21 01:03:22] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 29 ms.
[2020-05-21 01:03:25] [INFO ] Added : 304 causal constraints over 61 iterations in 2948 ms. Result :sat
[2020-05-21 01:03:28] [INFO ] Deduced a trap composed of 16 places in 2629 ms
[2020-05-21 01:03:30] [INFO ] Deduced a trap composed of 9 places in 1974 ms
[2020-05-21 01:03:31] [INFO ] Deduced a trap composed of 35 places in 656 ms
[2020-05-21 01:03:32] [INFO ] Deduced a trap composed of 27 places in 1240 ms
[2020-05-21 01:03:34] [INFO ] Deduced a trap composed of 9 places in 1782 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 27 places in 1142 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 27 places in 242 ms
[2020-05-21 01:03:36] [INFO ] Deduced a trap composed of 13 places in 351 ms
[2020-05-21 01:03:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s3 s67 s71 s112 s123 s136 s147 s158 s185 s206 s211 s216 s228) 0)") while checking expression at index 2
[2020-05-21 01:03:36] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:03:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:36] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2020-05-21 01:03:36] [INFO ] [Real]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-21 01:03:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 99 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:37] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:03:39] [INFO ] Deduced a trap composed of 9 places in 2100 ms
[2020-05-21 01:03:39] [INFO ] Deduced a trap composed of 39 places in 83 ms
[2020-05-21 01:03:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2247 ms
[2020-05-21 01:03:39] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 46 ms.
[2020-05-21 01:03:41] [INFO ] Added : 294 causal constraints over 59 iterations in 2189 ms. Result :sat
[2020-05-21 01:03:41] [INFO ] Deduced a trap composed of 31 places in 114 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 38 places in 1700 ms
[2020-05-21 01:03:45] [INFO ] Deduced a trap composed of 49 places in 1608 ms
[2020-05-21 01:03:46] [INFO ] Deduced a trap composed of 34 places in 657 ms
[2020-05-21 01:03:46] [INFO ] Deduced a trap composed of 16 places in 324 ms
[2020-05-21 01:03:46] [INFO ] Deduced a trap composed of 9 places in 278 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 13 places in 430 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 48 places in 383 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 49 places in 228 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 14 places in 238 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 31 places in 88 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 16 places in 143 ms
[2020-05-21 01:03:50] [INFO ] Deduced a trap composed of 9 places in 1541 ms
[2020-05-21 01:03:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8552 ms
[2020-05-21 01:03:50] [INFO ] [Real]Absence check using 11 positive place invariants in 48 ms returned sat
[2020-05-21 01:03:50] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-21 01:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:51] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-05-21 01:03:51] [INFO ] [Real]Added 66 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:03:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 37 ms returned sat
[2020-05-21 01:03:51] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 10 ms returned sat
[2020-05-21 01:03:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:52] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2020-05-21 01:03:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 56 ms returned sat
[2020-05-21 01:03:53] [INFO ] Deduced a trap composed of 13 places in 1389 ms
[2020-05-21 01:03:54] [INFO ] Deduced a trap composed of 18 places in 743 ms
[2020-05-21 01:03:56] [INFO ] Deduced a trap composed of 30 places in 1427 ms
[2020-05-21 01:03:56] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2020-05-21 01:03:56] [INFO ] Deduced a trap composed of 31 places in 471 ms
[2020-05-21 01:03:57] [INFO ] Deduced a trap composed of 38 places in 591 ms
[2020-05-21 01:03:58] [INFO ] Deduced a trap composed of 31 places in 1382 ms
[2020-05-21 01:03:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6336 ms
[2020-05-21 01:03:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 59 ms.
[2020-05-21 01:04:01] [INFO ] Added : 304 causal constraints over 61 iterations in 2985 ms. Result :sat
[2020-05-21 01:04:03] [INFO ] Deduced a trap composed of 21 places in 1781 ms
[2020-05-21 01:04:06] [INFO ] Deduced a trap composed of 9 places in 2521 ms
[2020-05-21 01:04:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4489 ms
[2020-05-21 01:04:06] [INFO ] [Real]Absence check using 11 positive place invariants in 96 ms returned sat
[2020-05-21 01:04:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 41 ms returned sat
[2020-05-21 01:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:07] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2020-05-21 01:04:07] [INFO ] [Real]Added 66 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:04:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:04:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 60 ms returned sat
[2020-05-21 01:04:07] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 15 ms returned sat
[2020-05-21 01:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:09] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2020-05-21 01:04:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 52 ms returned sat
[2020-05-21 01:04:11] [INFO ] Deduced a trap composed of 13 places in 2435 ms
[2020-05-21 01:04:13] [INFO ] Deduced a trap composed of 32 places in 1741 ms
[2020-05-21 01:04:15] [INFO ] Deduced a trap composed of 42 places in 2041 ms
[2020-05-21 01:04:17] [INFO ] Deduced a trap composed of 52 places in 2074 ms
[2020-05-21 01:04:19] [INFO ] Deduced a trap composed of 38 places in 1656 ms
[2020-05-21 01:04:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 10069 ms
[2020-05-21 01:04:19] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 49 ms.
[2020-05-21 01:04:22] [INFO ] Added : 303 causal constraints over 61 iterations in 3375 ms. Result :sat
[2020-05-21 01:04:24] [INFO ] Deduced a trap composed of 52 places in 1489 ms
[2020-05-21 01:04:25] [INFO ] Deduced a trap composed of 18 places in 1169 ms
[2020-05-21 01:04:25] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2020-05-21 01:04:25] [INFO ] Deduced a trap composed of 57 places in 182 ms
[2020-05-21 01:04:27] [INFO ] Deduced a trap composed of 64 places in 1765 ms
[2020-05-21 01:04:27] [INFO ] Deduced a trap composed of 14 places in 268 ms
[2020-05-21 01:04:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s57 s76 s112 s134 s144 s169 s182 s206 s211 s226 s228 s230 s236) 0)") while checking expression at index 5
[2020-05-21 01:04:27] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:04:27] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:28] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2020-05-21 01:04:28] [INFO ] [Real]Added 66 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:04:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:04:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 73 ms returned sat
[2020-05-21 01:04:29] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 22 ms returned sat
[2020-05-21 01:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:29] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-05-21 01:04:29] [INFO ] [Nat]Added 66 Read/Feed constraints in 51 ms returned sat
[2020-05-21 01:04:29] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-05-21 01:04:30] [INFO ] Deduced a trap composed of 13 places in 397 ms
[2020-05-21 01:04:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2020-05-21 01:04:30] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 75 ms.
[2020-05-21 01:04:32] [INFO ] Added : 304 causal constraints over 61 iterations in 2428 ms. Result :sat
[2020-05-21 01:04:34] [INFO ] Deduced a trap composed of 9 places in 1633 ms
[2020-05-21 01:04:35] [INFO ] Deduced a trap composed of 38 places in 998 ms
[2020-05-21 01:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2763 ms
[2020-05-21 01:04:35] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:04:35] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:36] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2020-05-21 01:04:36] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:04:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:04:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 74 ms returned sat
[2020-05-21 01:04:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 29 ms returned sat
[2020-05-21 01:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:37] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2020-05-21 01:04:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:04:38] [INFO ] Deduced a trap composed of 31 places in 1198 ms
[2020-05-21 01:04:39] [INFO ] Deduced a trap composed of 31 places in 1263 ms
[2020-05-21 01:04:41] [INFO ] Deduced a trap composed of 32 places in 1819 ms
[2020-05-21 01:04:41] [INFO ] Deduced a trap composed of 72 places in 245 ms
[2020-05-21 01:04:42] [INFO ] Deduced a trap composed of 11 places in 528 ms
[2020-05-21 01:04:42] [INFO ] Deduced a trap composed of 38 places in 158 ms
[2020-05-21 01:04:42] [INFO ] Deduced a trap composed of 13 places in 301 ms
[2020-05-21 01:04:43] [INFO ] Deduced a trap composed of 52 places in 201 ms
[2020-05-21 01:04:43] [INFO ] Deduced a trap composed of 52 places in 131 ms
[2020-05-21 01:04:44] [INFO ] Deduced a trap composed of 41 places in 829 ms
[2020-05-21 01:04:44] [INFO ] Deduced a trap composed of 35 places in 461 ms
[2020-05-21 01:04:46] [INFO ] Deduced a trap composed of 16 places in 1974 ms
[2020-05-21 01:04:47] [INFO ] Deduced a trap composed of 50 places in 489 ms
[2020-05-21 01:04:47] [INFO ] Deduced a trap composed of 50 places in 171 ms
[2020-05-21 01:04:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 10132 ms
[2020-05-21 01:04:47] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 35 ms.
[2020-05-21 01:04:50] [INFO ] Added : 303 causal constraints over 61 iterations in 2931 ms. Result :sat
[2020-05-21 01:04:52] [INFO ] Deduced a trap composed of 31 places in 2346 ms
[2020-05-21 01:04:52] [INFO ] Deduced a trap composed of 61 places in 265 ms
[2020-05-21 01:04:53] [INFO ] Deduced a trap composed of 27 places in 619 ms
[2020-05-21 01:04:54] [INFO ] Deduced a trap composed of 37 places in 315 ms
[2020-05-21 01:04:54] [INFO ] Deduced a trap composed of 27 places in 399 ms
[2020-05-21 01:04:54] [INFO ] Deduced a trap composed of 52 places in 263 ms
[2020-05-21 01:04:55] [INFO ] Deduced a trap composed of 12 places in 313 ms
[2020-05-21 01:04:55] [INFO ] Deduced a trap composed of 17 places in 192 ms
[2020-05-21 01:04:55] [INFO ] Deduced a trap composed of 56 places in 308 ms
[2020-05-21 01:04:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5619 ms
[2020-05-21 01:04:56] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:04:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:56] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2020-05-21 01:04:56] [INFO ] [Real]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:04:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:04:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-05-21 01:04:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-21 01:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:04:57] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2020-05-21 01:04:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 46 ms returned sat
[2020-05-21 01:04:59] [INFO ] Deduced a trap composed of 9 places in 2279 ms
[2020-05-21 01:04:59] [INFO ] Deduced a trap composed of 26 places in 100 ms
[2020-05-21 01:04:59] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2020-05-21 01:05:00] [INFO ] Deduced a trap composed of 9 places in 224 ms
[2020-05-21 01:05:00] [INFO ] Deduced a trap composed of 13 places in 302 ms
[2020-05-21 01:05:00] [INFO ] Deduced a trap composed of 26 places in 95 ms
[2020-05-21 01:05:00] [INFO ] Deduced a trap composed of 26 places in 64 ms
[2020-05-21 01:05:00] [INFO ] Deduced a trap composed of 29 places in 258 ms
[2020-05-21 01:05:01] [INFO ] Deduced a trap composed of 50 places in 72 ms
[2020-05-21 01:05:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3680 ms
[2020-05-21 01:05:01] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 65 ms.
[2020-05-21 01:05:03] [INFO ] Added : 304 causal constraints over 61 iterations in 2660 ms. Result :sat
[2020-05-21 01:05:04] [INFO ] Deduced a trap composed of 50 places in 606 ms
[2020-05-21 01:05:04] [INFO ] Deduced a trap composed of 74 places in 249 ms
[2020-05-21 01:05:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 992 ms
[2020-05-21 01:05:04] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:05:04] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:05] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2020-05-21 01:05:05] [INFO ] [Real]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-05-21 01:05:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:05:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-05-21 01:05:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:06] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2020-05-21 01:05:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 49 ms returned sat
[2020-05-21 01:05:10] [INFO ] Deduced a trap composed of 50 places in 3361 ms
[2020-05-21 01:05:11] [INFO ] Deduced a trap composed of 56 places in 749 ms
[2020-05-21 01:05:11] [INFO ] Deduced a trap composed of 49 places in 556 ms
[2020-05-21 01:05:12] [INFO ] Deduced a trap composed of 13 places in 695 ms
[2020-05-21 01:05:13] [INFO ] Deduced a trap composed of 49 places in 823 ms
[2020-05-21 01:05:13] [INFO ] Deduced a trap composed of 20 places in 123 ms
[2020-05-21 01:05:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6501 ms
[2020-05-21 01:05:13] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 41 ms.
[2020-05-21 01:05:15] [INFO ] Added : 298 causal constraints over 60 iterations in 2074 ms. Result :sat
[2020-05-21 01:05:15] [INFO ] Deduced a trap composed of 34 places in 42 ms
[2020-05-21 01:05:15] [INFO ] Deduced a trap composed of 12 places in 210 ms
[2020-05-21 01:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2020-05-21 01:05:16] [INFO ] [Real]Absence check using 11 positive place invariants in 71 ms returned sat
[2020-05-21 01:05:16] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 22 ms returned sat
[2020-05-21 01:05:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:17] [INFO ] [Real]Absence check using state equation in 1297 ms returned sat
[2020-05-21 01:05:17] [INFO ] [Real]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:05:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:05:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 43 ms returned sat
[2020-05-21 01:05:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 32 ms returned sat
[2020-05-21 01:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:18] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2020-05-21 01:05:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:05:19] [INFO ] Deduced a trap composed of 26 places in 1275 ms
[2020-05-21 01:05:21] [INFO ] Deduced a trap composed of 26 places in 1970 ms
[2020-05-21 01:05:21] [INFO ] Deduced a trap composed of 15 places in 324 ms
[2020-05-21 01:05:22] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-05-21 01:05:22] [INFO ] Deduced a trap composed of 9 places in 461 ms
[2020-05-21 01:05:24] [INFO ] Deduced a trap composed of 9 places in 1504 ms
[2020-05-21 01:05:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5788 ms
[2020-05-21 01:05:24] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-21 01:05:26] [INFO ] Added : 303 causal constraints over 61 iterations in 2834 ms. Result :sat
[2020-05-21 01:05:27] [INFO ] Deduced a trap composed of 27 places in 471 ms
[2020-05-21 01:05:27] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2020-05-21 01:05:28] [INFO ] Deduced a trap composed of 12 places in 969 ms
[2020-05-21 01:05:30] [INFO ] Deduced a trap composed of 27 places in 1739 ms
[2020-05-21 01:05:32] [INFO ] Deduced a trap composed of 34 places in 2316 ms
[2020-05-21 01:05:35] [INFO ] Deduced a trap composed of 44 places in 2165 ms
[2020-05-21 01:05:35] [INFO ] Deduced a trap composed of 16 places in 701 ms
[2020-05-21 01:05:36] [INFO ] Deduced a trap composed of 39 places in 370 ms
[2020-05-21 01:05:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 9323 ms
[2020-05-21 01:05:36] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:05:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:36] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2020-05-21 01:05:36] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:05:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:05:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:05:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:36] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2020-05-21 01:05:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:05:38] [INFO ] Deduced a trap composed of 13 places in 1417 ms
[2020-05-21 01:05:39] [INFO ] Deduced a trap composed of 13 places in 575 ms
[2020-05-21 01:05:39] [INFO ] Deduced a trap composed of 49 places in 869 ms
[2020-05-21 01:05:41] [INFO ] Deduced a trap composed of 83 places in 1551 ms
[2020-05-21 01:05:42] [INFO ] Deduced a trap composed of 38 places in 801 ms
[2020-05-21 01:05:42] [INFO ] Deduced a trap composed of 31 places in 220 ms
[2020-05-21 01:05:42] [INFO ] Deduced a trap composed of 31 places in 151 ms
[2020-05-21 01:05:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5791 ms
[2020-05-21 01:05:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 25 ms.
[2020-05-21 01:05:45] [INFO ] Added : 303 causal constraints over 61 iterations in 2574 ms. Result :sat
[2020-05-21 01:05:46] [INFO ] Deduced a trap composed of 30 places in 770 ms
[2020-05-21 01:05:47] [INFO ] Deduced a trap composed of 17 places in 1683 ms
[2020-05-21 01:05:49] [INFO ] Deduced a trap composed of 16 places in 1605 ms
[2020-05-21 01:05:51] [INFO ] Deduced a trap composed of 35 places in 1869 ms
[2020-05-21 01:05:53] [INFO ] Deduced a trap composed of 35 places in 2212 ms
[2020-05-21 01:05:55] [INFO ] Deduced a trap composed of 56 places in 1502 ms
[2020-05-21 01:05:57] [INFO ] Deduced a trap composed of 9 places in 1685 ms
[2020-05-21 01:05:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s66 s113 s124 s146 s159 s211 s216 s229 s236) 0)") while checking expression at index 11
[2020-05-21 01:05:57] [INFO ] [Real]Absence check using 11 positive place invariants in 52 ms returned sat
[2020-05-21 01:05:57] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-21 01:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:58] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2020-05-21 01:05:58] [INFO ] [Real]Added 66 Read/Feed constraints in 47 ms returned sat
[2020-05-21 01:05:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:05:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 38 ms returned sat
[2020-05-21 01:05:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:05:59] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2020-05-21 01:05:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 57 ms returned sat
[2020-05-21 01:06:01] [INFO ] Deduced a trap composed of 9 places in 2295 ms
[2020-05-21 01:06:03] [INFO ] Deduced a trap composed of 38 places in 1348 ms
[2020-05-21 01:06:04] [INFO ] Deduced a trap composed of 56 places in 1652 ms
[2020-05-21 01:06:06] [INFO ] Deduced a trap composed of 56 places in 1783 ms
[2020-05-21 01:06:07] [INFO ] Deduced a trap composed of 39 places in 994 ms
[2020-05-21 01:06:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8208 ms
[2020-05-21 01:06:07] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 52 ms.
[2020-05-21 01:06:11] [INFO ] Added : 304 causal constraints over 61 iterations in 3825 ms. Result :sat
[2020-05-21 01:06:13] [INFO ] Deduced a trap composed of 9 places in 2044 ms
[2020-05-21 01:06:15] [INFO ] Deduced a trap composed of 12 places in 1615 ms
[2020-05-21 01:06:16] [INFO ] Deduced a trap composed of 9 places in 865 ms
[2020-05-21 01:06:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4754 ms
[2020-05-21 01:06:16] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-21 01:06:16] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:06:17] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2020-05-21 01:06:17] [INFO ] [Real]Added 66 Read/Feed constraints in 54 ms returned sat
[2020-05-21 01:06:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:06:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 45 ms returned sat
[2020-05-21 01:06:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 24 ms returned sat
[2020-05-21 01:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:06:18] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2020-05-21 01:06:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 59 ms returned sat
[2020-05-21 01:06:19] [INFO ] Deduced a trap composed of 9 places in 1000 ms
[2020-05-21 01:06:20] [INFO ] Deduced a trap composed of 52 places in 532 ms
[2020-05-21 01:06:20] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-05-21 01:06:21] [INFO ] Deduced a trap composed of 38 places in 1196 ms
[2020-05-21 01:06:23] [INFO ] Deduced a trap composed of 31 places in 1610 ms
[2020-05-21 01:06:24] [INFO ] Deduced a trap composed of 31 places in 1364 ms
[2020-05-21 01:06:25] [INFO ] Deduced a trap composed of 39 places in 1204 ms
[2020-05-21 01:06:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7206 ms
[2020-05-21 01:06:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 35 ms.
[2020-05-21 01:06:29] [INFO ] Added : 302 causal constraints over 61 iterations in 3210 ms. Result :sat
[2020-05-21 01:06:31] [INFO ] Deduced a trap composed of 27 places in 1843 ms
[2020-05-21 01:06:33] [INFO ] Deduced a trap composed of 45 places in 2045 ms
[2020-05-21 01:06:35] [INFO ] Deduced a trap composed of 12 places in 1842 ms
[2020-05-21 01:06:36] [INFO ] Deduced a trap composed of 13 places in 1813 ms
[2020-05-21 01:06:38] [INFO ] Deduced a trap composed of 38 places in 1281 ms
[2020-05-21 01:06:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s3 s4 s15 s16 s27 s28 s37 s50 s67 s68 s71 s72 s91 s92 s93 s94 s110 s123 s127 s130 s135 s136 s147 s148 s154 s157 s158 s185 s186 s191 s192 s203 s204 s207 s212 s222 s226 s235) 0)") while checking expression at index 13
[2020-05-21 01:06:38] [INFO ] [Real]Absence check using 11 positive place invariants in 46 ms returned sat
[2020-05-21 01:06:38] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:06:39] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-05-21 01:06:39] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:06:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:06:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-05-21 01:06:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 10 ms returned sat
[2020-05-21 01:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:06:40] [INFO ] [Nat]Absence check using state equation in 1200 ms returned sat
[2020-05-21 01:06:40] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:06:41] [INFO ] Deduced a trap composed of 9 places in 596 ms
[2020-05-21 01:06:42] [INFO ] Deduced a trap composed of 15 places in 1789 ms
[2020-05-21 01:06:43] [INFO ] Deduced a trap composed of 31 places in 571 ms
[2020-05-21 01:06:43] [INFO ] Deduced a trap composed of 52 places in 267 ms
[2020-05-21 01:06:44] [INFO ] Deduced a trap composed of 49 places in 1212 ms
[2020-05-21 01:06:46] [INFO ] Deduced a trap composed of 42 places in 1043 ms
[2020-05-21 01:06:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5638 ms
[2020-05-21 01:06:46] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-21 01:06:48] [INFO ] Added : 304 causal constraints over 61 iterations in 2473 ms. Result :sat
[2020-05-21 01:06:49] [INFO ] Deduced a trap composed of 9 places in 1085 ms
[2020-05-21 01:06:50] [INFO ] Deduced a trap composed of 30 places in 1063 ms
[2020-05-21 01:06:52] [INFO ] Deduced a trap composed of 12 places in 2149 ms
[2020-05-21 01:06:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4474 ms
[2020-05-21 01:06:53] [INFO ] [Real]Absence check using 11 positive place invariants in 96 ms returned sat
[2020-05-21 01:06:53] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 31 ms returned sat
[2020-05-21 01:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:06:53] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2020-05-21 01:06:53] [INFO ] [Real]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-21 01:06:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:06:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:06:54] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:06:55] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2020-05-21 01:06:55] [INFO ] [Nat]Added 66 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:06:55] [INFO ] Deduced a trap composed of 33 places in 114 ms
[2020-05-21 01:06:55] [INFO ] Deduced a trap composed of 23 places in 413 ms
[2020-05-21 01:06:57] [INFO ] Deduced a trap composed of 31 places in 1237 ms
[2020-05-21 01:06:58] [INFO ] Deduced a trap composed of 23 places in 1133 ms
[2020-05-21 01:06:58] [INFO ] Deduced a trap composed of 40 places in 470 ms
[2020-05-21 01:06:59] [INFO ] Deduced a trap composed of 26 places in 523 ms
[2020-05-21 01:06:59] [INFO ] Deduced a trap composed of 13 places in 195 ms
[2020-05-21 01:06:59] [INFO ] Deduced a trap composed of 13 places in 451 ms
[2020-05-21 01:07:00] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-05-21 01:07:01] [INFO ] Deduced a trap composed of 9 places in 1593 ms
[2020-05-21 01:07:02] [INFO ] Deduced a trap composed of 34 places in 344 ms
[2020-05-21 01:07:02] [INFO ] Deduced a trap composed of 12 places in 844 ms
[2020-05-21 01:07:03] [INFO ] Deduced a trap composed of 87 places in 91 ms
[2020-05-21 01:07:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7837 ms
[2020-05-21 01:07:03] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 35 ms.
[2020-05-21 01:07:05] [INFO ] Added : 304 causal constraints over 61 iterations in 2510 ms. Result :sat
[2020-05-21 01:07:06] [INFO ] Deduced a trap composed of 34 places in 426 ms
[2020-05-21 01:07:06] [INFO ] Deduced a trap composed of 48 places in 522 ms
[2020-05-21 01:07:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1085 ms
[2020-05-21 01:07:06] [INFO ] [Real]Absence check using 11 positive place invariants in 44 ms returned sat
[2020-05-21 01:07:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 32 ms returned sat
[2020-05-21 01:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:07] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-05-21 01:07:07] [INFO ] [Real]Added 66 Read/Feed constraints in 30 ms returned sat
[2020-05-21 01:07:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:07:08] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:08] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2020-05-21 01:07:08] [INFO ] [Nat]Added 66 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 9 places in 910 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 36 places in 443 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 31 places in 94 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 21 places in 318 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 42 places in 71 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 49 places in 77 ms
[2020-05-21 01:07:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2108 ms
[2020-05-21 01:07:10] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 39 ms.
[2020-05-21 01:07:12] [INFO ] Added : 304 causal constraints over 61 iterations in 2156 ms. Result :sat
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 16 places in 1474 ms
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 54 places in 462 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 34 places in 551 ms
[2020-05-21 01:07:16] [INFO ] Deduced a trap composed of 34 places in 851 ms
[2020-05-21 01:07:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3592 ms
[2020-05-21 01:07:16] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-05-21 01:07:16] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:16] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2020-05-21 01:07:16] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:07:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-21 01:07:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:17] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2020-05-21 01:07:17] [INFO ] [Nat]Added 66 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:07:18] [INFO ] Deduced a trap composed of 9 places in 669 ms
[2020-05-21 01:07:21] [INFO ] Deduced a trap composed of 9 places in 2699 ms
[2020-05-21 01:07:23] [INFO ] Deduced a trap composed of 9 places in 2335 ms
[2020-05-21 01:07:25] [INFO ] Deduced a trap composed of 45 places in 1830 ms
[2020-05-21 01:07:26] [INFO ] Deduced a trap composed of 27 places in 1379 ms
[2020-05-21 01:07:28] [INFO ] Deduced a trap composed of 45 places in 1241 ms
[2020-05-21 01:07:30] [INFO ] Deduced a trap composed of 27 places in 2163 ms
[2020-05-21 01:07:31] [INFO ] Deduced a trap composed of 35 places in 1221 ms
[2020-05-21 01:07:32] [INFO ] Deduced a trap composed of 49 places in 543 ms
[2020-05-21 01:07:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 14426 ms
[2020-05-21 01:07:32] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 64 ms.
[2020-05-21 01:07:35] [INFO ] Added : 304 causal constraints over 61 iterations in 3447 ms. Result :sat
[2020-05-21 01:07:37] [INFO ] Deduced a trap composed of 18 places in 2046 ms
[2020-05-21 01:07:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s12 s57 s76 s79 s111 s125 s134 s144 s169 s178 s182 s206 s211 s226 s227 s230 s236) 0)") while checking expression at index 17
[2020-05-21 01:07:37] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-05-21 01:07:37] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:39] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2020-05-21 01:07:39] [INFO ] [Real]Added 66 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:07:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 85 ms returned sat
[2020-05-21 01:07:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 24 ms returned sat
[2020-05-21 01:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Nat]Added 66 Read/Feed constraints in 47 ms returned sat
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 9 places in 1692 ms
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 15 places in 2027 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 9 places in 1744 ms
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 13 places in 1890 ms
[2020-05-21 01:07:48] [INFO ] Deduced a trap composed of 57 places in 1216 ms
[2020-05-21 01:07:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8705 ms
[2020-05-21 01:07:48] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 37 ms.
[2020-05-21 01:07:52] [INFO ] Added : 304 causal constraints over 61 iterations in 3394 ms. Result :sat
[2020-05-21 01:07:53] [INFO ] Deduced a trap composed of 34 places in 1633 ms
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 16 places in 1638 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 16 places in 1922 ms
[2020-05-21 01:07:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5384 ms
[2020-05-21 01:07:57] [INFO ] [Real]Absence check using 11 positive place invariants in 64 ms returned sat
[2020-05-21 01:07:57] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 17 ms returned sat
[2020-05-21 01:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:58] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2020-05-21 01:07:58] [INFO ] [Real]Added 66 Read/Feed constraints in 42 ms returned sat
[2020-05-21 01:07:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 47 ms returned sat
[2020-05-21 01:07:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:00] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2020-05-21 01:08:00] [INFO ] [Nat]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:08:02] [INFO ] Deduced a trap composed of 27 places in 2279 ms
[2020-05-21 01:08:04] [INFO ] Deduced a trap composed of 27 places in 1845 ms
[2020-05-21 01:08:06] [INFO ] Deduced a trap composed of 9 places in 1852 ms
[2020-05-21 01:08:08] [INFO ] Deduced a trap composed of 13 places in 1748 ms
[2020-05-21 01:08:09] [INFO ] Deduced a trap composed of 13 places in 1758 ms
[2020-05-21 01:08:11] [INFO ] Deduced a trap composed of 27 places in 1914 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 45 places in 1259 ms
[2020-05-21 01:08:14] [INFO ] Deduced a trap composed of 45 places in 1284 ms
[2020-05-21 01:08:15] [INFO ] Deduced a trap composed of 45 places in 1573 ms
[2020-05-21 01:08:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 15760 ms
[2020-05-21 01:08:16] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 34 ms.
[2020-05-21 01:08:19] [INFO ] Added : 275 causal constraints over 55 iterations in 3050 ms. Result :(error "Failed to check-sat")
[2020-05-21 01:08:19] [INFO ] [Real]Absence check using 11 positive place invariants in 99 ms returned sat
[2020-05-21 01:08:19] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:20] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2020-05-21 01:08:20] [INFO ] [Real]Added 66 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:08:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 52 ms returned sat
[2020-05-21 01:08:20] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:21] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2020-05-21 01:08:21] [INFO ] [Nat]Added 66 Read/Feed constraints in 68 ms returned sat
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 9 places in 346 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 39 places in 180 ms
[2020-05-21 01:08:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2020-05-21 01:08:22] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-21 01:08:25] [INFO ] Added : 304 causal constraints over 61 iterations in 2929 ms. Result :sat
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 35 places in 860 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 12 places in 661 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 9 places in 759 ms
[2020-05-21 01:08:28] [INFO ] Deduced a trap composed of 34 places in 216 ms
[2020-05-21 01:08:29] [INFO ] Deduced a trap composed of 9 places in 1269 ms
[2020-05-21 01:08:31] [INFO ] Deduced a trap composed of 45 places in 1612 ms
[2020-05-21 01:08:32] [INFO ] Deduced a trap composed of 29 places in 1187 ms
[2020-05-21 01:08:34] [INFO ] Deduced a trap composed of 38 places in 1829 ms
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 27 places in 1139 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 16 places in 1594 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 13 places in 841 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 38 places in 998 ms
[2020-05-21 01:08:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 13661 ms
[2020-05-21 01:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 40 ms returned sat
[2020-05-21 01:08:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 27 ms returned sat
[2020-05-21 01:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:40] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2020-05-21 01:08:40] [INFO ] [Real]Added 66 Read/Feed constraints in 50 ms returned sat
[2020-05-21 01:08:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 93 ms returned sat
[2020-05-21 01:08:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 20 ms returned sat
[2020-05-21 01:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:41] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2020-05-21 01:08:41] [INFO ] [Nat]Added 66 Read/Feed constraints in 60 ms returned sat
[2020-05-21 01:08:42] [INFO ] Deduced a trap composed of 9 places in 1335 ms
[2020-05-21 01:08:43] [INFO ] Deduced a trap composed of 9 places in 212 ms
[2020-05-21 01:08:44] [INFO ] Deduced a trap composed of 12 places in 1323 ms
[2020-05-21 01:08:46] [INFO ] Deduced a trap composed of 9 places in 1947 ms
[2020-05-21 01:08:47] [INFO ] Deduced a trap composed of 38 places in 831 ms
[2020-05-21 01:08:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5812 ms
[2020-05-21 01:08:47] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 41 ms.
[2020-05-21 01:08:49] [INFO ] Added : 303 causal constraints over 61 iterations in 2447 ms. Result :sat
[2020-05-21 01:08:51] [INFO ] Deduced a trap composed of 49 places in 1322 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 54 places in 1769 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 53 places in 985 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 52 places in 61 ms
[2020-05-21 01:08:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4396 ms
[2020-05-21 01:08:54] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:08:54] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:55] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2020-05-21 01:08:55] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:08:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-05-21 01:08:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:56] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2020-05-21 01:08:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:08:57] [INFO ] Deduced a trap composed of 14 places in 1623 ms
[2020-05-21 01:08:59] [INFO ] Deduced a trap composed of 18 places in 1690 ms
[2020-05-21 01:09:00] [INFO ] Deduced a trap composed of 19 places in 1124 ms
[2020-05-21 01:09:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4516 ms
[2020-05-21 01:09:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 33 ms.
[2020-05-21 01:09:03] [INFO ] Added : 304 causal constraints over 61 iterations in 3120 ms. Result :sat
[2020-05-21 01:09:06] [INFO ] Deduced a trap composed of 12 places in 2329 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 18 places in 4336 ms
[2020-05-21 01:09:14] [INFO ] Deduced a trap composed of 27 places in 3540 ms
[2020-05-21 01:09:18] [INFO ] Deduced a trap composed of 18 places in 3821 ms
[2020-05-21 01:09:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s14 s65 s69 s90 s109 s111 s128 s145 s160 s187 s202 s206 s216 s226 s227 s230 s236) 0)") while checking expression at index 22
[2020-05-21 01:09:18] [INFO ] [Real]Absence check using 11 positive place invariants in 100 ms returned sat
[2020-05-21 01:09:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 29 ms returned sat
[2020-05-21 01:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:19] [INFO ] [Real]Absence check using state equation in 1378 ms returned sat
[2020-05-21 01:09:19] [INFO ] [Real]Added 66 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:09:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 52 ms returned sat
[2020-05-21 01:09:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 32 ms returned sat
[2020-05-21 01:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:20] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2020-05-21 01:09:20] [INFO ] [Nat]Added 66 Read/Feed constraints in 28 ms returned sat
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 9 places in 1234 ms
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 20 places in 675 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 38 places in 2063 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 35 places in 561 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 49 places in 117 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 53 places in 1226 ms
[2020-05-21 01:09:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6037 ms
[2020-05-21 01:09:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 34 ms.
[2020-05-21 01:09:29] [INFO ] Added : 304 causal constraints over 61 iterations in 2300 ms. Result :sat
[2020-05-21 01:09:30] [INFO ] Deduced a trap composed of 52 places in 1205 ms
[2020-05-21 01:09:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1273 ms
[2020-05-21 01:09:30] [INFO ] [Real]Absence check using 11 positive place invariants in 47 ms returned sat
[2020-05-21 01:09:30] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 40 ms returned sat
[2020-05-21 01:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:32] [INFO ] [Real]Absence check using state equation in 1787 ms returned sat
[2020-05-21 01:09:32] [INFO ] [Real]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:09:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:09:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:33] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2020-05-21 01:09:33] [INFO ] [Nat]Added 66 Read/Feed constraints in 47 ms returned sat
[2020-05-21 01:09:33] [INFO ] Deduced a trap composed of 9 places in 373 ms
[2020-05-21 01:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2020-05-21 01:09:33] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-21 01:09:36] [INFO ] Added : 304 causal constraints over 61 iterations in 2708 ms. Result :sat
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 34 places in 2260 ms
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2020-05-21 01:09:39] [INFO ] Deduced a trap composed of 52 places in 193 ms
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 53 places in 1878 ms
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 52 places in 154 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 27 places in 1692 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 16 places in 1556 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 38 places in 1424 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 41 places in 80 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 27 places in 516 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 34 places in 65 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 11 places in 240 ms
[2020-05-21 01:09:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10928 ms
[2020-05-21 01:09:47] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:09:47] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:48] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-05-21 01:09:48] [INFO ] [Real]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:09:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 46 ms returned sat
[2020-05-21 01:09:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:49] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2020-05-21 01:09:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 53 ms returned sat
[2020-05-21 01:09:51] [INFO ] Deduced a trap composed of 9 places in 1822 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 13 places in 2141 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 26 places in 2363 ms
[2020-05-21 01:09:58] [INFO ] Deduced a trap composed of 13 places in 2589 ms
[2020-05-21 01:10:00] [INFO ] Deduced a trap composed of 12 places in 1795 ms
[2020-05-21 01:10:01] [INFO ] Deduced a trap composed of 27 places in 1783 ms
[2020-05-21 01:10:03] [INFO ] Deduced a trap composed of 27 places in 1729 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 38 places in 1577 ms
[2020-05-21 01:10:06] [INFO ] Deduced a trap composed of 56 places in 1541 ms
[2020-05-21 01:10:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 17587 ms
[2020-05-21 01:10:06] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 52 ms.
[2020-05-21 01:10:08] [INFO ] Added : 130 causal constraints over 26 iterations in 1426 ms. Result :unknown
[2020-05-21 01:10:08] [INFO ] [Real]Absence check using 11 positive place invariants in 109 ms returned sat
[2020-05-21 01:10:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 26 ms returned sat
[2020-05-21 01:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:09] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2020-05-21 01:10:09] [INFO ] [Real]Added 66 Read/Feed constraints in 58 ms returned sat
[2020-05-21 01:10:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 37 ms returned sat
[2020-05-21 01:10:10] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 17 ms returned sat
[2020-05-21 01:10:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:11] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2020-05-21 01:10:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 59 ms returned sat
[2020-05-21 01:10:13] [INFO ] Deduced a trap composed of 11 places in 2094 ms
[2020-05-21 01:10:15] [INFO ] Deduced a trap composed of 38 places in 1818 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 56 places in 1676 ms
[2020-05-21 01:10:18] [INFO ] Deduced a trap composed of 56 places in 1690 ms
[2020-05-21 01:10:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7412 ms
[2020-05-21 01:10:18] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 50 ms.
[2020-05-21 01:10:22] [INFO ] Added : 304 causal constraints over 61 iterations in 3608 ms. Result :sat
[2020-05-21 01:10:25] [INFO ] Deduced a trap composed of 70 places in 2733 ms
[2020-05-21 01:10:26] [INFO ] Deduced a trap composed of 38 places in 1605 ms
[2020-05-21 01:10:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4476 ms
[2020-05-21 01:10:26] [INFO ] [Real]Absence check using 11 positive place invariants in 51 ms returned sat
[2020-05-21 01:10:26] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 17 ms returned sat
[2020-05-21 01:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:28] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2020-05-21 01:10:28] [INFO ] [Real]Added 66 Read/Feed constraints in 54 ms returned sat
[2020-05-21 01:10:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 56 ms returned sat
[2020-05-21 01:10:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 40 ms returned sat
[2020-05-21 01:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:29] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2020-05-21 01:10:29] [INFO ] [Nat]Added 66 Read/Feed constraints in 58 ms returned sat
[2020-05-21 01:10:31] [INFO ] Deduced a trap composed of 9 places in 2429 ms
[2020-05-21 01:10:34] [INFO ] Deduced a trap composed of 16 places in 2268 ms
[2020-05-21 01:10:36] [INFO ] Deduced a trap composed of 61 places in 2222 ms
[2020-05-21 01:10:38] [INFO ] Deduced a trap composed of 31 places in 1579 ms
[2020-05-21 01:10:39] [INFO ] Deduced a trap composed of 31 places in 1116 ms
[2020-05-21 01:10:40] [INFO ] Deduced a trap composed of 41 places in 1314 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 61 places in 1503 ms
[2020-05-21 01:10:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 12677 ms
[2020-05-21 01:10:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 40 ms.
[2020-05-21 01:10:45] [INFO ] Added : 304 causal constraints over 61 iterations in 3668 ms. Result :sat
[2020-05-21 01:10:47] [INFO ] Deduced a trap composed of 16 places in 1333 ms
[2020-05-21 01:10:48] [INFO ] Deduced a trap composed of 30 places in 1231 ms
[2020-05-21 01:10:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s4 s14 s26 s39 s52 s65 s68 s69 s72 s90 s95 s109 s112 s128 s135 s145 s148 s152 s157 s160 s186 s187 s190 s202 s207 s212 s224 s228 s235) 0)") while checking expression at index 27
[2020-05-21 01:10:48] [INFO ] [Real]Absence check using 11 positive place invariants in 38 ms returned sat
[2020-05-21 01:10:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 18 ms returned sat
[2020-05-21 01:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:49] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2020-05-21 01:10:49] [INFO ] [Real]Added 66 Read/Feed constraints in 53 ms returned sat
[2020-05-21 01:10:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 59 ms returned sat
[2020-05-21 01:10:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 24 ms returned sat
[2020-05-21 01:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:50] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2020-05-21 01:10:50] [INFO ] [Nat]Added 66 Read/Feed constraints in 52 ms returned sat
[2020-05-21 01:10:53] [INFO ] Deduced a trap composed of 9 places in 2096 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 31 places in 1866 ms
[2020-05-21 01:10:56] [INFO ] Deduced a trap composed of 31 places in 1688 ms
[2020-05-21 01:10:58] [INFO ] Deduced a trap composed of 52 places in 1932 ms
[2020-05-21 01:11:00] [INFO ] Deduced a trap composed of 52 places in 1681 ms
[2020-05-21 01:11:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 9389 ms
[2020-05-21 01:11:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 61 ms.
[2020-05-21 01:11:04] [INFO ] Added : 304 causal constraints over 61 iterations in 3896 ms. Result :sat
[2020-05-21 01:11:07] [INFO ] Deduced a trap composed of 27 places in 2912 ms
[2020-05-21 01:11:08] [INFO ] Deduced a trap composed of 34 places in 924 ms
[2020-05-21 01:11:10] [INFO ] Deduced a trap composed of 13 places in 2253 ms
[2020-05-21 01:11:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s3 s67 s71 s112 s123 s136 s147 s158 s185 s206 s211 s216 s228) 0)") while checking expression at index 28
[2020-05-21 01:11:10] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-05-21 01:11:10] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:11] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2020-05-21 01:11:11] [INFO ] [Real]Added 66 Read/Feed constraints in 54 ms returned sat
[2020-05-21 01:11:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 111 ms returned sat
[2020-05-21 01:11:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 22 ms returned sat
[2020-05-21 01:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:13] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2020-05-21 01:11:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 70 ms returned sat
[2020-05-21 01:11:15] [INFO ] Deduced a trap composed of 9 places in 2164 ms
[2020-05-21 01:11:16] [INFO ] Deduced a trap composed of 16 places in 1070 ms
[2020-05-21 01:11:18] [INFO ] Deduced a trap composed of 9 places in 1621 ms
[2020-05-21 01:11:20] [INFO ] Deduced a trap composed of 9 places in 1795 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 34 places in 1187 ms
[2020-05-21 01:11:22] [INFO ] Deduced a trap composed of 35 places in 996 ms
[2020-05-21 01:11:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8991 ms
[2020-05-21 01:11:22] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 53 ms.
[2020-05-21 01:11:26] [INFO ] Added : 304 causal constraints over 61 iterations in 3691 ms. Result :sat
[2020-05-21 01:11:28] [INFO ] Deduced a trap composed of 34 places in 2474 ms
[2020-05-21 01:11:31] [INFO ] Deduced a trap composed of 16 places in 2328 ms
[2020-05-21 01:11:33] [INFO ] Deduced a trap composed of 27 places in 2029 ms
[2020-05-21 01:11:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s12 s23 s34 s45 s57 s62 s76 s79 s98 s113 s121 s125 s134 s144 s151 s163 s167 s169 s178 s182 s195 s209 s212 s225 s229 s235) 0)") while checking expression at index 29
[2020-05-21 01:11:33] [INFO ] [Real]Absence check using 11 positive place invariants in 72 ms returned sat
[2020-05-21 01:11:33] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 39 ms returned sat
[2020-05-21 01:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:34] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2020-05-21 01:11:34] [INFO ] [Real]Added 66 Read/Feed constraints in 42 ms returned sat
[2020-05-21 01:11:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 63 ms returned sat
[2020-05-21 01:11:34] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 19 ms returned sat
[2020-05-21 01:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:35] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2020-05-21 01:11:35] [INFO ] [Nat]Added 66 Read/Feed constraints in 51 ms returned sat
[2020-05-21 01:11:37] [INFO ] Deduced a trap composed of 13 places in 1878 ms
[2020-05-21 01:11:38] [INFO ] Deduced a trap composed of 27 places in 1404 ms
[2020-05-21 01:11:40] [INFO ] Deduced a trap composed of 49 places in 1795 ms
[2020-05-21 01:11:42] [INFO ] Deduced a trap composed of 49 places in 1670 ms
[2020-05-21 01:11:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6818 ms
[2020-05-21 01:11:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 40 ms.
[2020-05-21 01:11:46] [INFO ] Added : 304 causal constraints over 61 iterations in 3740 ms. Result :sat
[2020-05-21 01:11:46] [INFO ] Deduced a trap composed of 17 places in 342 ms
[2020-05-21 01:11:47] [INFO ] Deduced a trap composed of 27 places in 713 ms
[2020-05-21 01:11:49] [INFO ] Deduced a trap composed of 18 places in 2168 ms
[2020-05-21 01:11:51] [INFO ] Deduced a trap composed of 52 places in 1949 ms
[2020-05-21 01:11:53] [INFO ] Deduced a trap composed of 53 places in 1807 ms
[2020-05-21 01:11:55] [INFO ] Deduced a trap composed of 9 places in 2204 ms
[2020-05-21 01:11:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s65 s109 s113 s145 s160 s206 s216 s229 s236) 0)") while checking expression at index 30
[2020-05-21 01:11:55] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-05-21 01:11:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-05-21 01:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:56] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2020-05-21 01:11:56] [INFO ] [Real]Added 66 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:11:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 54 ms returned sat
[2020-05-21 01:11:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 19 ms returned sat
[2020-05-21 01:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:58] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2020-05-21 01:11:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 58 ms returned sat
[2020-05-21 01:12:00] [INFO ] Deduced a trap composed of 9 places in 2389 ms
[2020-05-21 01:12:02] [INFO ] Deduced a trap composed of 9 places in 2158 ms
[2020-05-21 01:12:04] [INFO ] Deduced a trap composed of 9 places in 1716 ms
[2020-05-21 01:12:06] [INFO ] Deduced a trap composed of 27 places in 1526 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 27 places in 1139 ms
[2020-05-21 01:12:08] [INFO ] Deduced a trap composed of 27 places in 1251 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 45 places in 1167 ms
[2020-05-21 01:12:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 11501 ms
[2020-05-21 01:12:09] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 44 ms.
[2020-05-21 01:12:13] [INFO ] Added : 302 causal constraints over 61 iterations in 3719 ms. Result :sat
[2020-05-21 01:12:14] [INFO ] Deduced a trap composed of 16 places in 888 ms
[2020-05-21 01:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 956 ms
[2020-05-21 01:12:14] [INFO ] [Real]Absence check using 11 positive place invariants in 67 ms returned sat
[2020-05-21 01:12:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-21 01:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:15] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2020-05-21 01:12:15] [INFO ] [Real]Added 66 Read/Feed constraints in 52 ms returned sat
[2020-05-21 01:12:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 70 ms returned sat
[2020-05-21 01:12:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-21 01:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:16] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2020-05-21 01:12:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:12:18] [INFO ] Deduced a trap composed of 9 places in 1851 ms
[2020-05-21 01:12:20] [INFO ] Deduced a trap composed of 9 places in 1831 ms
[2020-05-21 01:12:22] [INFO ] Deduced a trap composed of 44 places in 1834 ms
[2020-05-21 01:12:25] [INFO ] Deduced a trap composed of 9 places in 2858 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 43 places in 1060 ms
[2020-05-21 01:12:28] [INFO ] Deduced a trap composed of 12 places in 2040 ms
[2020-05-21 01:12:29] [INFO ] Deduced a trap composed of 30 places in 973 ms
[2020-05-21 01:12:31] [INFO ] Deduced a trap composed of 27 places in 2166 ms
[2020-05-21 01:12:35] [INFO ] Deduced a trap composed of 26 places in 3578 ms
[2020-05-21 01:12:35] [INFO ] Deduced a trap composed of 56 places in 611 ms
[2020-05-21 01:12:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s3 s7 s10 s16 s20 s21 s28 s29 s36 s37 s41 s50 s54 s63 s67 s71 s74 s77 s84 s88 s92 s93 s100 s104 s105 s110 s118 s120 s123 s127 s132 s136 s137 s139 s143 s147 s158 s162 s166 s171 s173 s180 s184 s185 s192 s193 s200 s204 s205 s210 s214 s219 s222 s226 s234 s240) 0)") while checking expression at index 32
[2020-05-21 01:12:36] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:36] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:12:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 50 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:37] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2020-05-21 01:12:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 48 ms returned sat
[2020-05-21 01:12:39] [INFO ] Deduced a trap composed of 9 places in 2277 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 49 places in 257 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 24 places in 716 ms
[2020-05-21 01:12:41] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 31 places in 1228 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 52 places in 352 ms
[2020-05-21 01:12:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5168 ms
[2020-05-21 01:12:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-21 01:12:45] [INFO ] Added : 304 causal constraints over 61 iterations in 2306 ms. Result :sat
[2020-05-21 01:12:46] [INFO ] Deduced a trap composed of 48 places in 1122 ms
[2020-05-21 01:12:46] [INFO ] Deduced a trap composed of 12 places in 229 ms
[2020-05-21 01:12:47] [INFO ] Deduced a trap composed of 13 places in 676 ms
[2020-05-21 01:12:47] [INFO ] Deduced a trap composed of 49 places in 432 ms
[2020-05-21 01:12:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2649 ms
[2020-05-21 01:12:47] [INFO ] [Real]Absence check using 11 positive place invariants in 50 ms returned sat
[2020-05-21 01:12:47] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 40 ms returned sat
[2020-05-21 01:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:49] [INFO ] [Real]Absence check using state equation in 1578 ms returned sat
[2020-05-21 01:12:49] [INFO ] [Real]Added 66 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:12:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:12:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:50] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2020-05-21 01:12:50] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:12:51] [INFO ] Deduced a trap composed of 56 places in 609 ms
[2020-05-21 01:12:51] [INFO ] Deduced a trap composed of 56 places in 183 ms
[2020-05-21 01:12:52] [INFO ] Deduced a trap composed of 39 places in 891 ms
[2020-05-21 01:12:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1770 ms
[2020-05-21 01:12:52] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 44 ms.
[2020-05-21 01:12:54] [INFO ] Added : 304 causal constraints over 61 iterations in 2351 ms. Result :sat
[2020-05-21 01:12:58] [INFO ] Deduced a trap composed of 38 places in 3304 ms
[2020-05-21 01:12:59] [INFO ] Deduced a trap composed of 52 places in 1799 ms
[2020-05-21 01:13:01] [INFO ] Deduced a trap composed of 52 places in 1564 ms
[2020-05-21 01:13:02] [INFO ] Deduced a trap composed of 53 places in 1216 ms
[2020-05-21 01:13:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8179 ms
[2020-05-21 01:13:03] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-21 01:13:03] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:03] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2020-05-21 01:13:03] [INFO ] [Real]Added 66 Read/Feed constraints in 35 ms returned sat
[2020-05-21 01:13:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:05] [INFO ] [Nat]Absence check using state equation in 1915 ms returned sat
[2020-05-21 01:13:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 23 places in 777 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 38 places in 281 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 9 places in 141 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 9 places in 1916 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 15 places in 97 ms
[2020-05-21 01:13:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3365 ms
[2020-05-21 01:13:09] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 39 ms.
[2020-05-21 01:13:12] [INFO ] Added : 304 causal constraints over 61 iterations in 2704 ms. Result :sat
[2020-05-21 01:13:12] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:13:12] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:12] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2020-05-21 01:13:12] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:13:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 36 ms returned sat
[2020-05-21 01:13:12] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:14] [INFO ] [Nat]Absence check using state equation in 1439 ms returned sat
[2020-05-21 01:13:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 51 ms returned sat
[2020-05-21 01:13:15] [INFO ] Deduced a trap composed of 9 places in 1085 ms
[2020-05-21 01:13:15] [INFO ] Deduced a trap composed of 52 places in 315 ms
[2020-05-21 01:13:17] [INFO ] Deduced a trap composed of 52 places in 1709 ms
[2020-05-21 01:13:17] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-05-21 01:13:19] [INFO ] Deduced a trap composed of 34 places in 1477 ms
[2020-05-21 01:13:20] [INFO ] Deduced a trap composed of 51 places in 1435 ms
[2020-05-21 01:13:21] [INFO ] Deduced a trap composed of 31 places in 688 ms
[2020-05-21 01:13:22] [INFO ] Deduced a trap composed of 53 places in 1532 ms
[2020-05-21 01:13:22] [INFO ] Deduced a trap composed of 52 places in 118 ms
[2020-05-21 01:13:23] [INFO ] Deduced a trap composed of 35 places in 293 ms
[2020-05-21 01:13:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9049 ms
[2020-05-21 01:13:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 35 ms.
[2020-05-21 01:13:25] [INFO ] Added : 304 causal constraints over 61 iterations in 2489 ms. Result :sat
[2020-05-21 01:13:25] [INFO ] Deduced a trap composed of 52 places in 92 ms
[2020-05-21 01:13:26] [INFO ] Deduced a trap composed of 12 places in 543 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 30 places in 1008 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 34 places in 59 ms
[2020-05-21 01:13:29] [INFO ] Deduced a trap composed of 9 places in 1318 ms
[2020-05-21 01:13:30] [INFO ] Deduced a trap composed of 27 places in 676 ms
[2020-05-21 01:13:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4246 ms
[2020-05-21 01:13:30] [INFO ] [Real]Absence check using 11 positive place invariants in 81 ms returned sat
[2020-05-21 01:13:30] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 42 ms returned sat
[2020-05-21 01:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:31] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2020-05-21 01:13:31] [INFO ] [Real]Added 66 Read/Feed constraints in 55 ms returned sat
[2020-05-21 01:13:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 55 ms returned sat
[2020-05-21 01:13:31] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 19 ms returned sat
[2020-05-21 01:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:32] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2020-05-21 01:13:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 85 ms returned sat
[2020-05-21 01:13:34] [INFO ] Deduced a trap composed of 9 places in 1869 ms
[2020-05-21 01:13:36] [INFO ] Deduced a trap composed of 33 places in 1961 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 13 places in 2510 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 49 places in 1960 ms
[2020-05-21 01:13:43] [INFO ] Deduced a trap composed of 49 places in 2152 ms
[2020-05-21 01:13:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 10636 ms
[2020-05-21 01:13:43] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 38 ms.
[2020-05-21 01:13:47] [INFO ] Added : 304 causal constraints over 61 iterations in 3666 ms. Result :sat
[2020-05-21 01:13:48] [INFO ] Deduced a trap composed of 21 places in 1783 ms
[2020-05-21 01:13:51] [INFO ] Deduced a trap composed of 9 places in 2074 ms
[2020-05-21 01:13:51] [INFO ] Deduced a trap composed of 20 places in 704 ms
[2020-05-21 01:13:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s14 s26 s65 s69 s90 s95 s109 s110 s128 s145 s152 s160 s187 s190 s202 s206 s216 s226 s236) 0)") while checking expression at index 37
[2020-05-21 01:13:51] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-21 01:13:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-21 01:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:52] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2020-05-21 01:13:52] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:13:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 45 ms returned sat
[2020-05-21 01:13:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:53] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2020-05-21 01:13:53] [INFO ] [Nat]Added 66 Read/Feed constraints in 35 ms returned sat
[2020-05-21 01:13:54] [INFO ] Deduced a trap composed of 62 places in 596 ms
[2020-05-21 01:13:57] [INFO ] Deduced a trap composed of 9 places in 2857 ms
[2020-05-21 01:13:59] [INFO ] Deduced a trap composed of 20 places in 2249 ms
[2020-05-21 01:13:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5788 ms
[2020-05-21 01:13:59] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-21 01:14:02] [INFO ] Added : 304 causal constraints over 61 iterations in 3020 ms. Result :sat
[2020-05-21 01:14:04] [INFO ] Deduced a trap composed of 27 places in 2044 ms
[2020-05-21 01:14:06] [INFO ] Deduced a trap composed of 45 places in 1772 ms
[2020-05-21 01:14:07] [INFO ] Deduced a trap composed of 49 places in 1157 ms
[2020-05-21 01:14:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5197 ms
[2020-05-21 01:14:07] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-21 01:14:07] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-21 01:14:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:08] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2020-05-21 01:14:08] [INFO ] [Real]Added 66 Read/Feed constraints in 27 ms returned sat
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 9 places in 1460 ms
[2020-05-21 01:14:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1485 ms
[2020-05-21 01:14:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:14:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-05-21 01:14:10] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 14 ms returned sat
[2020-05-21 01:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:11] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2020-05-21 01:14:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 64 ms returned sat
[2020-05-21 01:14:13] [INFO ] Deduced a trap composed of 9 places in 1525 ms
[2020-05-21 01:14:15] [INFO ] Deduced a trap composed of 9 places in 2060 ms
[2020-05-21 01:14:17] [INFO ] Deduced a trap composed of 9 places in 2145 ms
[2020-05-21 01:14:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5834 ms
[2020-05-21 01:14:17] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 55 ms.
[2020-05-21 01:14:20] [INFO ] Added : 304 causal constraints over 61 iterations in 3538 ms. Result :sat
[2020-05-21 01:14:23] [INFO ] Deduced a trap composed of 17 places in 2104 ms
[2020-05-21 01:14:23] [INFO ] Deduced a trap composed of 34 places in 556 ms
[2020-05-21 01:14:24] [INFO ] Deduced a trap composed of 35 places in 1002 ms
[2020-05-21 01:14:26] [INFO ] Deduced a trap composed of 20 places in 1804 ms
[2020-05-21 01:14:27] [INFO ] Deduced a trap composed of 34 places in 1024 ms
[2020-05-21 01:14:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6808 ms
[2020-05-21 01:14:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-21 01:14:28] [INFO ] Flatten gal took : 299 ms
FORMULA Peterson-PT-3-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:14:28] [INFO ] Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:14:29] [INFO ] Applying decomposition
[2020-05-21 01:14:29] [INFO ] Flatten gal took : 96 ms
[2020-05-21 01:14:29] [INFO ] Input system was already deterministic with 332 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/graph15115691637651777199.txt, -o, /tmp/graph15115691637651777199.bin, -w, /tmp/graph15115691637651777199.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/graph15115691637651777199.bin, -l, -1, -v, -w, /tmp/graph15115691637651777199.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:14:30] [INFO ] Decomposing Gal with order
[2020-05-21 01:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:14:30] [INFO ] Removed a total of 217 redundant transitions.
[2020-05-21 01:14:30] [INFO ] Flatten gal took : 358 ms
[2020-05-21 01:14:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 35 ms.
[2020-05-21 01:14:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 150 ms
[2020-05-21 01:14:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 48 ms
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:14:31] [INFO ] Computed 15 place invariants in 29 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:14:31] [INFO ] Computed 15 place invariants in 30 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 15 LTL properties
Checking formula 0 : !((X(X(G("((((i12.i1.u48.EndTurn_0_2>=1)||(i6.i0.u10.EndTurn_2_2>=1))||(i0.i1.u52.EndTurn_3_2>=1))||(i10.i1.u53.EndTurn_1_2>=1))")))))
Formula 0 simplified : !XXG"((((i12.i1.u48.EndTurn_0_2>=1)||(i6.i0.u10.EndTurn_2_2>=1))||(i0.i1.u52.EndTurn_3_2>=1))||(i10.i1.u53.EndTurn_1_2>=1))"
built 57 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 35 ordering constraints for composite.
built 6 ordering constraints for composite.
built 29 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-21 01:14:32] [INFO ] Proved 244 variables to be positive in 1875 ms
[2020-05-21 01:14:32] [INFO ] Computing symmetric may disable matrix : 332 transitions.
[2020-05-21 01:14:32] [INFO ] Computation of disable matrix completed :0/332 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:14:33] [INFO ] Computation of Complete disable matrix. took 134 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:14:33] [INFO ] Computing symmetric may enable matrix : 332 transitions.
[2020-05-21 01:14:33] [INFO ] Computation of Complete enable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:14:55] [INFO ] Computing symmetric co enabling matrix : 332 transitions.
[2020-05-21 01:14:57] [INFO ] Computation of co-enabling matrix(0/332) took 1833 ms. Total solver calls (SAT/UNSAT): 100(9/91)
[2020-05-21 01:15:01] [INFO ] Computation of co-enabling matrix(6/332) took 6044 ms. Total solver calls (SAT/UNSAT): 625(27/598)
[2020-05-21 01:15:06] [INFO ] Computation of co-enabling matrix(11/332) took 10764 ms. Total solver calls (SAT/UNSAT): 1061(45/1016)
[2020-05-21 01:15:10] [INFO ] Computation of co-enabling matrix(15/332) took 14648 ms. Total solver calls (SAT/UNSAT): 1413(63/1350)
[2020-05-21 01:15:14] [INFO ] Computation of co-enabling matrix(18/332) took 18251 ms. Total solver calls (SAT/UNSAT): 1683(81/1602)
[2020-05-21 01:15:18] [INFO ] Computation of co-enabling matrix(22/332) took 22217 ms. Total solver calls (SAT/UNSAT): 2028(99/1929)
[2020-05-21 01:15:22] [INFO ] Computation of co-enabling matrix(26/332) took 26215 ms. Total solver calls (SAT/UNSAT): 2378(126/2252)
[2020-05-21 01:15:25] [INFO ] Computation of co-enabling matrix(30/332) took 30104 ms. Total solver calls (SAT/UNSAT): 2715(144/2571)
[2020-05-21 01:15:29] [INFO ] Computation of co-enabling matrix(33/332) took 33855 ms. Total solver calls (SAT/UNSAT): 2975(162/2813)
Reverse transition relation is NOT exact ! Due to transitions BecomeIdle_0, UpdateTurn_1_3_2, UpdateTurn_2_3_2, BecomeIdle_1, BecomeIdle_2, BecomeIdle_3, EndLoop_3_1, EndLoop_3_0, 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_1_2_2, UpdateTurn_3_2_2, UpdateTurn_0_3_2, UpdateTurn_2_1_2, UpdateTurn_3_1_2, UpdateTurn_0_2_2, UpdateTurn_1_0_2, UpdateTurn_2_0_2, UpdateTurn_3_0_2, UpdateTurn_0_1_2, i0.i1.u52.UpdateTurn_3_3_2, i6.i0.u71.UpdateTurn_2_2_2, i8.UpdateTurn_3_3_0, i8.UpdateTurn_2_3_0, i8.UpdateTurn_1_0_0, i8.UpdateTurn_1_1_0, i8.UpdateTurn_2_2_0, i8.UpdateTurn_3_2_0, i8.u8.EndLoop_2_0, i8.u9.EndLoop_1_0, i8.u36.EndLoop_0_0, i8.u36.UpdateTurn_0_3_0, i8.u36.UpdateTurn_0_2_0, i8.u36.UpdateTurn_0_1_0, i8.u36.UpdateTurn_0_0_0, i10.i1.u53.UpdateTurn_1_1_2, i12.i1.u67.UpdateTurn_0_0_2, i13.UpdateTurn_3_0_1, i13.UpdateTurn_0_1_1, i13.UpdateTurn_1_0_1, i13.UpdateTurn_2_0_1, i13.UpdateTurn_3_1_1, i13.UpdateTurn_0_2_1, i13.UpdateTurn_2_1_1, i13.UpdateTurn_3_2_1, i13.UpdateTurn_0_3_1, i13.UpdateTurn_1_2_1, i13.UpdateTurn_2_3_1, i13.UpdateTurn_1_3_1, i13.u37.EndLoop_0_1, i13.u37.UpdateTurn_0_0_1, i13.u49.UpdateTurn_3_3_1, i13.u50.EndLoop_2_1, i13.u50.UpdateTurn_2_2_1, i13.u68.EndLoop_1_1, i13.u68.UpdateTurn_1_1_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/248/78/326
[2020-05-21 01:15:33] [INFO ] Computation of co-enabling matrix(36/332) took 37459 ms. Total solver calls (SAT/UNSAT): 3238(177/3061)
[2020-05-21 01:15:38] [INFO ] Computation of co-enabling matrix(38/332) took 42860 ms. Total solver calls (SAT/UNSAT): 3465(204/3261)
[2020-05-21 01:15:42] [INFO ] Computation of co-enabling matrix(44/332) took 46990 ms. Total solver calls (SAT/UNSAT): 3933(222/3711)
[2020-05-21 01:15:46] [INFO ] Computation of co-enabling matrix(49/332) took 50845 ms. Total solver calls (SAT/UNSAT): 4321(240/4081)
[2020-05-21 01:15:50] [INFO ] Computation of co-enabling matrix(52/332) took 54519 ms. Total solver calls (SAT/UNSAT): 4563(258/4305)
[2020-05-21 01:15:53] [INFO ] Computation of co-enabling matrix(54/332) took 58060 ms. Total solver calls (SAT/UNSAT): 4740(276/4464)
[2020-05-21 01:15:57] [INFO ] Computation of co-enabling matrix(57/332) took 61630 ms. Total solver calls (SAT/UNSAT): 4981(294/4687)
[2020-05-21 01:16:02] [INFO ] Computation of co-enabling matrix(63/332) took 66260 ms. Total solver calls (SAT/UNSAT): 5422(312/5110)
[2020-05-21 01:16:06] [INFO ] Computation of co-enabling matrix(66/332) took 70166 ms. Total solver calls (SAT/UNSAT): 5665(339/5326)
[2020-05-21 01:16:09] [INFO ] Computation of co-enabling matrix(70/332) took 73923 ms. Total solver calls (SAT/UNSAT): 5962(357/5605)
[2020-05-21 01:16:13] [INFO ] Computation of co-enabling matrix(74/332) took 77720 ms. Total solver calls (SAT/UNSAT): 6255(375/5880)
[2020-05-21 01:16:16] [INFO ] Computation of co-enabling matrix(78/332) took 80958 ms. Total solver calls (SAT/UNSAT): 6544(393/6151)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10456 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,104.769,492908,1,0,653497,8915,4325,3.18931e+06,504,58916,1800625
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 : !((X(!(F((G(F(("((((((((((((((((((((((((((((((((((((i11.i0.u14.IsEndLoop_0_0_0>=1)||(i9.i0.u2.IsEndLoop_1_0_0>=1))||(i7.u60.IsEndLoop_2_0_0>=1))||(i4.u31.IsEndLoop_3_0_0>=1))||(i5.i0.u12.IsEndLoop_0_1_0>=1))||(i1.u3.IsEndLoop_1_1_0>=1))||(i2.u33.IsEndLoop_2_1_0>=1))||(i3.u32.IsEndLoop_3_1_0>=1))||(i12.i0.u0.IsEndLoop_0_2_0>=1))||(i10.i0.u16.IsEndLoop_1_2_0>=1))||(i6.i1.u15.IsEndLoop_2_2_0>=1))||(i0.i0.u1.IsEndLoop_3_2_0>=1))||(i11.i1.u56.IsEndLoop_0_0_1>=1))||(i7.u22.IsEndLoop_2_0_1>=1))||(i9.i0.u2.IsEndLoop_1_0_1>=1))||(i5.i1.u19.IsEndLoop_0_1_1>=1))||(i4.u20.IsEndLoop_3_0_1>=1))||(i2.u4.IsEndLoop_2_1_1>=1))||(i1.u3.IsEndLoop_1_1_1>=1))||(i12.i1.u18.IsEndLoop_0_2_1>=1))||(i3.u29.IsEndLoop_3_1_1>=1))||(i6.i2.u26.IsEndLoop_2_2_1>=1))||(i10.i0.u24.IsEndLoop_1_2_1>=1))||(i11.i1.u62.IsEndLoop_0_0_2>=1))||(i0.i1.u23.IsEndLoop_3_2_1>=1))||(i7.u22.IsEndLoop_2_0_2>=1))||(i9.i1.u61.IsEndLoop_1_0_2>=1))||(i5.i1.u21.IsEndLoop_0_1_2>=1))||(i4.u5.IsEndLoop_3_0_2>=1))||(i3.u6.IsEndLoop_3_1_2>=1))||(i12.i1.u27.IsEndLoop_0_2_2>=1))||(i1.u66.IsEndLoop_1_1_2>=1))||(i2.u4.IsEndLoop_2_1_2>=1))||(i0.i1.u65.IsEndLoop_3_2_2>=1))||(i10.i1.u64.IsEndLoop_1_2_2>=1))||(i6.i2.u26.IsEndLoop_2_2_2>=1))")U("(((((((((((((((((((((((((((((((((((((((((((((((((i8.u36.Turn_0_1>=1)&&(i8.u8.AskForSection_2_0>=1))||((i8.u36.Turn_0_0>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i12.i1.u67.AskForSection_0_2>=1)&&(i0.i1.u52.Turn_2_3>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i8.u7.AskForSection_3_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i13.u50.AskForSection_2_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u49.AskForSection_3_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i8.u8.AskForSection_2_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i8.u36.AskForSection_0_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u68.AskForSection_1_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u9.AskForSection_1_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.AskForSection_0_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u50.AskForSection_2_1>=1)))"))))U("(((((((((((((((((((((((((((((((((((((i13.u49.TestTurn_3_1<1)||(i13.u68.Turn_1_1<1))&&((i13.u37.TestTurn_0_1<1)||(i13.u49.Turn_1_3<1)))&&((i0.i1.u52.TestTurn_3_2<1)||(i10.i1.u53.Turn_2_1<1)))&&((i8.u7.TestTurn_3_0<1)||(i8.u36.Turn_0_0<1)))&&((i8.u8.TestTurn_2_0<1)||(i8.u36.Turn_0_1<1)))&&((i10.i1.u53.TestTurn_1_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i0.i1.u52.TestTurn_3_2<1)||(i12.i1.u67.Turn_2_0<1)))&&((i0.i1.u52.TestTurn_3_2<1)||(i6.i0.u71.Turn_2_2<1)))&&((i8.u7.TestTurn_3_0<1)||(i8.u36.Turn_0_1<1)))&&((i13.u68.TestTurn_1_1<1)||(i13.u49.Turn_1_3<1)))&&((i8.u8.TestTurn_2_0<1)||(i8.u36.Turn_0_0<1)))&&((i13.u49.TestTurn_3_1<1)||(i13.u37.Turn_1_0<1)))&&((i8.u9.TestTurn_1_0<1)||(i8.u36.Turn_0_2<1)))&&((i13.u49.TestTurn_3_1<1)||(i13.u50.Turn_1_2<1)))&&((i8.u7.TestTurn_3_0<1)||(i8.u36.Turn_0_2<1)))&&((i13.u37.TestTurn_0_1<1)||(i13.u68.Turn_1_1<1)))&&((i6.i0.u71.TestTurn_2_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i12.i1.u67.TestTurn_0_2<1)||(i6.i0.u71.Turn_2_2<1)))&&((i13.u50.TestTurn_2_1<1)||(i13.u49.Turn_1_3<1)))&&((i8.u36.TestTurn_0_0<1)||(i8.u36.Turn_0_2<1)))&&((i8.u8.TestTurn_2_0<1)||(i8.u36.Turn_0_3<1)))&&((i13.u37.TestTurn_0_1<1)||(i13.u50.Turn_1_2<1)))&&((i12.i1.u67.TestTurn_0_2<1)||(i10.i1.u53.Turn_2_1<1)))&&((i13.u68.TestTurn_1_1<1)||(i13.u50.Turn_1_2<1)))&&((i12.i1.u67.TestTurn_0_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i8.u36.TestTurn_0_0<1)||(i8.u36.Turn_0_1<1)))&&((i8.u9.TestTurn_1_0<1)||(i8.u36.Turn_0_3<1)))&&((i10.i1.u53.TestTurn_1_2<1)||(i6.i0.u71.Turn_2_2<1)))&&((i10.i1.u53.TestTurn_1_2<1)||(i12.i1.u67.Turn_2_0<1)))&&((i13.u68.TestTurn_1_1<1)||(i13.u37.Turn_1_0<1)))&&((i13.u50.TestTurn_2_1<1)||(i13.u37.Turn_1_0<1)))&&((i13.u50.TestTurn_2_1<1)||(i13.u68.Turn_1_1<1)))&&((i8.u36.TestTurn_0_0<1)||(i8.u36.Turn_0_3<1)))&&((i8.u9.TestTurn_1_0<1)||(i8.u36.Turn_0_0<1)))&&((i6.i0.u71.TestTurn_2_2<1)||(i10.i1.u53.Turn_2_1<1)))&&((i6.i0.u71.TestTurn_2_2<1)||(i12.i1.u67.Turn_2_0<1)))"))))))
Formula 1 simplified : !X!F(GF("((((((((((((((((((((((((((((((((((((i11.i0.u14.IsEndLoop_0_0_0>=1)||(i9.i0.u2.IsEndLoop_1_0_0>=1))||(i7.u60.IsEndLoop_2_0_0>=1))||(i4.u31.IsEndLoop_3_0_0>=1))||(i5.i0.u12.IsEndLoop_0_1_0>=1))||(i1.u3.IsEndLoop_1_1_0>=1))||(i2.u33.IsEndLoop_2_1_0>=1))||(i3.u32.IsEndLoop_3_1_0>=1))||(i12.i0.u0.IsEndLoop_0_2_0>=1))||(i10.i0.u16.IsEndLoop_1_2_0>=1))||(i6.i1.u15.IsEndLoop_2_2_0>=1))||(i0.i0.u1.IsEndLoop_3_2_0>=1))||(i11.i1.u56.IsEndLoop_0_0_1>=1))||(i7.u22.IsEndLoop_2_0_1>=1))||(i9.i0.u2.IsEndLoop_1_0_1>=1))||(i5.i1.u19.IsEndLoop_0_1_1>=1))||(i4.u20.IsEndLoop_3_0_1>=1))||(i2.u4.IsEndLoop_2_1_1>=1))||(i1.u3.IsEndLoop_1_1_1>=1))||(i12.i1.u18.IsEndLoop_0_2_1>=1))||(i3.u29.IsEndLoop_3_1_1>=1))||(i6.i2.u26.IsEndLoop_2_2_1>=1))||(i10.i0.u24.IsEndLoop_1_2_1>=1))||(i11.i1.u62.IsEndLoop_0_0_2>=1))||(i0.i1.u23.IsEndLoop_3_2_1>=1))||(i7.u22.IsEndLoop_2_0_2>=1))||(i9.i1.u61.IsEndLoop_1_0_2>=1))||(i5.i1.u21.IsEndLoop_0_1_2>=1))||(i4.u5.IsEndLoop_3_0_2>=1))||(i3.u6.IsEndLoop_3_1_2>=1))||(i12.i1.u27.IsEndLoop_0_2_2>=1))||(i1.u66.IsEndLoop_1_1_2>=1))||(i2.u4.IsEndLoop_2_1_2>=1))||(i0.i1.u65.IsEndLoop_3_2_2>=1))||(i10.i1.u64.IsEndLoop_1_2_2>=1))||(i6.i2.u26.IsEndLoop_2_2_2>=1))" U "(((((((((((((((((((((((((((((((((((((((((((((((((i8.u36.Turn_0_1>=1)&&(i8.u8.AskForSection_2_0>=1))||((i8.u36.Turn_0_0>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i12.i1.u67.AskForSection_0_2>=1)&&(i0.i1.u52.Turn_2_3>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i8.u7.AskForSection_3_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i13.u50.AskForSection_2_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u49.AskForSection_3_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i8.u8.AskForSection_2_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i8.u36.AskForSection_0_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u68.AskForSection_1_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u9.AskForSection_1_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.AskForSection_0_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u50.AskForSection_2_1>=1)))") U "(((((((((((((((((((((((((((((((((((((i13.u49.TestTurn_3_1<1)||(i13.u68.Turn_1_1<1))&&((i13.u37.TestTurn_0_1<1)||(i13.u49.Turn_1_3<1)))&&((i0.i1.u52.TestTurn_3_2<1)||(i10.i1.u53.Turn_2_1<1)))&&((i8.u7.TestTurn_3_0<1)||(i8.u36.Turn_0_0<1)))&&((i8.u8.TestTurn_2_0<1)||(i8.u36.Turn_0_1<1)))&&((i10.i1.u53.TestTurn_1_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i0.i1.u52.TestTurn_3_2<1)||(i12.i1.u67.Turn_2_0<1)))&&((i0.i1.u52.TestTurn_3_2<1)||(i6.i0.u71.Turn_2_2<1)))&&((i8.u7.TestTurn_3_0<1)||(i8.u36.Turn_0_1<1)))&&((i13.u68.TestTurn_1_1<1)||(i13.u49.Turn_1_3<1)))&&((i8.u8.TestTurn_2_0<1)||(i8.u36.Turn_0_0<1)))&&((i13.u49.TestTurn_3_1<1)||(i13.u37.Turn_1_0<1)))&&((i8.u9.TestTurn_1_0<1)||(i8.u36.Turn_0_2<1)))&&((i13.u49.TestTurn_3_1<1)||(i13.u50.Turn_1_2<1)))&&((i8.u7.TestTurn_3_0<1)||(i8.u36.Turn_0_2<1)))&&((i13.u37.TestTurn_0_1<1)||(i13.u68.Turn_1_1<1)))&&((i6.i0.u71.TestTurn_2_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i12.i1.u67.TestTurn_0_2<1)||(i6.i0.u71.Turn_2_2<1)))&&((i13.u50.TestTurn_2_1<1)||(i13.u49.Turn_1_3<1)))&&((i8.u36.TestTurn_0_0<1)||(i8.u36.Turn_0_2<1)))&&((i8.u8.TestTurn_2_0<1)||(i8.u36.Turn_0_3<1)))&&((i13.u37.TestTurn_0_1<1)||(i13.u50.Turn_1_2<1)))&&((i12.i1.u67.TestTurn_0_2<1)||(i10.i1.u53.Turn_2_1<1)))&&((i13.u68.TestTurn_1_1<1)||(i13.u50.Turn_1_2<1)))&&((i12.i1.u67.TestTurn_0_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i8.u36.TestTurn_0_0<1)||(i8.u36.Turn_0_1<1)))&&((i8.u9.TestTurn_1_0<1)||(i8.u36.Turn_0_3<1)))&&((i10.i1.u53.TestTurn_1_2<1)||(i6.i0.u71.Turn_2_2<1)))&&((i10.i1.u53.TestTurn_1_2<1)||(i12.i1.u67.Turn_2_0<1)))&&((i13.u68.TestTurn_1_1<1)||(i13.u37.Turn_1_0<1)))&&((i13.u50.TestTurn_2_1<1)||(i13.u37.Turn_1_0<1)))&&((i13.u50.TestTurn_2_1<1)||(i13.u68.Turn_1_1<1)))&&((i8.u36.TestTurn_0_0<1)||(i8.u36.Turn_0_3<1)))&&((i8.u9.TestTurn_1_0<1)||(i8.u36.Turn_0_0<1)))&&((i6.i0.u71.TestTurn_2_2<1)||(i10.i1.u53.Turn_2_1<1)))&&((i6.i0.u71.TestTurn_2_2<1)||(i12.i1.u67.Turn_2_0<1)))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
62 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,105.4,498260,1,0,658319,8918,4635,3.20909e+06,518,58937,1817557
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-PT-3-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(((((i8.u69.WantSection_3_F>=1)&&(i8.u69.Idle_3>=1))||((i9.i1.u28.WantSection_2_F>=1)&&(i9.i1.u28.Idle_2>=1)))||((i12.i1.u70.WantSection_1_F>=1)&&(i12.i1.u70.Idle_1>=1)))||((i10.i0.u16.WantSection_0_F>=1)&&(i8.u25.Idle_0>=1)))")U("((((((((i13.u37.EndTurn_0_1>=1)||(i8.u8.EndTurn_2_0>=1))||(i8.u7.EndTurn_3_0>=1))||(i8.u9.EndTurn_1_0>=1))||(i13.u50.EndTurn_2_1>=1))||(i13.u49.EndTurn_3_1>=1))||(i13.u68.EndTurn_1_1>=1))||(i8.u36.EndTurn_0_0>=1))")))
Formula 2 simplified : !("(((((i8.u69.WantSection_3_F>=1)&&(i8.u69.Idle_3>=1))||((i9.i1.u28.WantSection_2_F>=1)&&(i9.i1.u28.Idle_2>=1)))||((i12.i1.u70.WantSection_1_F>=1)&&(i12.i1.u70.Idle_1>=1)))||((i10.i0.u16.WantSection_0_F>=1)&&(i8.u25.Idle_0>=1)))" U "((((((((i13.u37.EndTurn_0_1>=1)||(i8.u8.EndTurn_2_0>=1))||(i8.u7.EndTurn_3_0>=1))||(i8.u9.EndTurn_1_0>=1))||(i13.u50.EndTurn_2_1>=1))||(i13.u49.EndTurn_3_1>=1))||(i13.u68.EndTurn_1_1>=1))||(i8.u36.EndTurn_0_0>=1))")
[2020-05-21 01:16:20] [INFO ] Computation of co-enabling matrix(84/332) took 85153 ms. Total solver calls (SAT/UNSAT): 6952(411/6541)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
537 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,110.766,614716,1,0,813541,9327,4741,4.10972e+06,520,62988,2121895
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-3-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(F(((((((((((((F(X("(((((((((((((((((((((((((((((((((((((((((((((((((i8.u36.Turn_0_1<1)||(i8.u8.AskForSection_2_0<1))&&((i8.u36.Turn_0_0<1)||(i8.u9.AskForSection_1_0<1)))&&((i8.u36.Turn_0_1<1)||(i8.u9.AskForSection_1_0<1)))&&((i8.u36.Turn_0_0<1)||(i8.u36.AskForSection_0_0<1)))&&((i8.u36.Turn_0_1<1)||(i8.u7.AskForSection_3_0<1)))&&((i12.i1.u67.AskForSection_0_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i8.u36.Turn_0_0<1)||(i8.u7.AskForSection_3_0<1)))&&((i8.u36.Turn_0_0<1)||(i8.u8.AskForSection_2_0<1)))&&((i8.u7.AskForSection_3_0<1)||(i8.u36.Turn_0_3<1)))&&((i6.i0.u71.Turn_2_2<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i12.i1.u67.Turn_2_0<1)||(i12.i1.u67.AskForSection_0_2<1)))&&((i6.i0.u71.Turn_2_2<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i6.i0.u71.Turn_2_2<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i10.i1.u53.Turn_2_1<1)||(i12.i1.u67.AskForSection_0_2<1)))&&((i13.u50.Turn_1_2<1)||(i13.u37.AskForSection_0_1<1)))&&((i8.u36.Turn_0_1<1)||(i8.u36.AskForSection_0_0<1)))&&((i13.u50.Turn_1_2<1)||(i13.u49.AskForSection_3_1<1)))&&((i13.u50.Turn_1_2<1)||(i13.u68.AskForSection_1_1<1)))&&((i13.u50.Turn_1_2<1)||(i13.u50.AskForSection_2_1<1)))&&((i13.u50.AskForSection_2_1<1)||(i13.u49.Turn_1_3<1)))&&((i13.u49.AskForSection_3_1<1)||(i13.u49.Turn_1_3<1)))&&((i8.u8.AskForSection_2_0<1)||(i8.u36.Turn_0_3<1)))&&((i8.u36.Turn_0_2<1)||(i8.u36.AskForSection_0_0<1)))&&((i10.i1.u53.Turn_2_1<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i8.u36.Turn_0_2<1)||(i8.u9.AskForSection_1_0<1)))&&((i8.u36.Turn_0_2<1)||(i8.u8.AskForSection_2_0<1)))&&((i10.i1.u53.Turn_2_1<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i8.u36.Turn_0_2<1)||(i8.u7.AskForSection_3_0<1)))&&((i0.i1.u52.Turn_2_3<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i10.i1.u53.Turn_2_1<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i8.u36.AskForSection_0_0<1)||(i8.u36.Turn_0_3<1)))&&((i0.i1.u52.Turn_2_3<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i6.i0.u71.Turn_2_2<1)||(i12.i1.u67.AskForSection_0_2<1)))&&((i13.u68.AskForSection_1_1<1)||(i13.u49.Turn_1_3<1)))&&((i0.i1.u52.Turn_2_3<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i13.u37.Turn_1_0<1)||(i13.u68.AskForSection_1_1<1)))&&((i13.u37.Turn_1_0<1)||(i13.u50.AskForSection_2_1<1)))&&((i12.i1.u67.Turn_2_0<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i13.u37.Turn_1_0<1)||(i13.u37.AskForSection_0_1<1)))&&((i12.i1.u67.Turn_2_0<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i12.i1.u67.Turn_2_0<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i13.u68.Turn_1_1<1)||(i13.u68.AskForSection_1_1<1)))&&((i13.u68.Turn_1_1<1)||(i13.u37.AskForSection_0_1<1)))&&((i8.u9.AskForSection_1_0<1)||(i8.u36.Turn_0_3<1)))&&((i13.u68.Turn_1_1<1)||(i13.u49.AskForSection_3_1<1)))&&((i13.u37.Turn_1_0<1)||(i13.u49.AskForSection_3_1<1)))&&((i13.u37.AskForSection_0_1<1)||(i13.u49.Turn_1_3<1)))&&((i13.u68.Turn_1_1<1)||(i13.u50.AskForSection_2_1<1)))")))||("(i10.i0.u24.TestIdentity_1_2_1>=1)"))||("(i6.i2.u26.TestIdentity_2_2_2>=1)"))||("(i12.i0.u44.TestIdentity_0_2_0>=1)"))||("(i4.u5.TestIdentity_3_0_3>=1)"))||("(i0.i1.u65.TestIdentity_3_2_3>=1)"))||("(i2.u4.TestIdentity_2_1_2>=1)"))||("(i3.u6.TestIdentity_3_1_3>=1)"))||("(i9.i0.u2.TestIdentity_1_0_1>=1)"))||("(i7.u22.TestIdentity_2_0_2>=1)"))||("(i11.i0.u51.TestIdentity_0_0_0>=1)"))||("(i1.u3.TestIdentity_1_1_1>=1)"))||("(i5.i0.u11.TestIdentity_0_1_0>=1)"))))))
Formula 3 simplified : !XXF("(i0.i1.u65.TestIdentity_3_2_3>=1)" | "(i1.u3.TestIdentity_1_1_1>=1)" | "(i2.u4.TestIdentity_2_1_2>=1)" | "(i3.u6.TestIdentity_3_1_3>=1)" | "(i4.u5.TestIdentity_3_0_3>=1)" | "(i5.i0.u11.TestIdentity_0_1_0>=1)" | "(i6.i2.u26.TestIdentity_2_2_2>=1)" | "(i7.u22.TestIdentity_2_0_2>=1)" | "(i9.i0.u2.TestIdentity_1_0_1>=1)" | "(i10.i0.u24.TestIdentity_1_2_1>=1)" | "(i11.i0.u51.TestIdentity_0_0_0>=1)" | "(i12.i0.u44.TestIdentity_0_2_0>=1)" | FX"(((((((((((((((((((((((((((((((((((((((((((((((((i8.u36.Turn_0_1<1)||(i8.u8.AskForSection_2_0<1))&&((i8.u36.Turn_0_0<1)||(i8.u9.AskForSection_1_0<1)))&&((i8.u36.Turn_0_1<1)||(i8.u9.AskForSection_1_0<1)))&&((i8.u36.Turn_0_0<1)||(i8.u36.AskForSection_0_0<1)))&&((i8.u36.Turn_0_1<1)||(i8.u7.AskForSection_3_0<1)))&&((i12.i1.u67.AskForSection_0_2<1)||(i0.i1.u52.Turn_2_3<1)))&&((i8.u36.Turn_0_0<1)||(i8.u7.AskForSection_3_0<1)))&&((i8.u36.Turn_0_0<1)||(i8.u8.AskForSection_2_0<1)))&&((i8.u7.AskForSection_3_0<1)||(i8.u36.Turn_0_3<1)))&&((i6.i0.u71.Turn_2_2<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i12.i1.u67.Turn_2_0<1)||(i12.i1.u67.AskForSection_0_2<1)))&&((i6.i0.u71.Turn_2_2<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i6.i0.u71.Turn_2_2<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i10.i1.u53.Turn_2_1<1)||(i12.i1.u67.AskForSection_0_2<1)))&&((i13.u50.Turn_1_2<1)||(i13.u37.AskForSection_0_1<1)))&&((i8.u36.Turn_0_1<1)||(i8.u36.AskForSection_0_0<1)))&&((i13.u50.Turn_1_2<1)||(i13.u49.AskForSection_3_1<1)))&&((i13.u50.Turn_1_2<1)||(i13.u68.AskForSection_1_1<1)))&&((i13.u50.Turn_1_2<1)||(i13.u50.AskForSection_2_1<1)))&&((i13.u50.AskForSection_2_1<1)||(i13.u49.Turn_1_3<1)))&&((i13.u49.AskForSection_3_1<1)||(i13.u49.Turn_1_3<1)))&&((i8.u8.AskForSection_2_0<1)||(i8.u36.Turn_0_3<1)))&&((i8.u36.Turn_0_2<1)||(i8.u36.AskForSection_0_0<1)))&&((i10.i1.u53.Turn_2_1<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i8.u36.Turn_0_2<1)||(i8.u9.AskForSection_1_0<1)))&&((i8.u36.Turn_0_2<1)||(i8.u8.AskForSection_2_0<1)))&&((i10.i1.u53.Turn_2_1<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i8.u36.Turn_0_2<1)||(i8.u7.AskForSection_3_0<1)))&&((i0.i1.u52.Turn_2_3<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i10.i1.u53.Turn_2_1<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i8.u36.AskForSection_0_0<1)||(i8.u36.Turn_0_3<1)))&&((i0.i1.u52.Turn_2_3<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i6.i0.u71.Turn_2_2<1)||(i12.i1.u67.AskForSection_0_2<1)))&&((i13.u68.AskForSection_1_1<1)||(i13.u49.Turn_1_3<1)))&&((i0.i1.u52.Turn_2_3<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i13.u37.Turn_1_0<1)||(i13.u68.AskForSection_1_1<1)))&&((i13.u37.Turn_1_0<1)||(i13.u50.AskForSection_2_1<1)))&&((i12.i1.u67.Turn_2_0<1)||(i0.i1.u52.AskForSection_3_2<1)))&&((i13.u37.Turn_1_0<1)||(i13.u37.AskForSection_0_1<1)))&&((i12.i1.u67.Turn_2_0<1)||(i10.i1.u53.AskForSection_1_2<1)))&&((i12.i1.u67.Turn_2_0<1)||(i6.i0.u71.AskForSection_2_2<1)))&&((i13.u68.Turn_1_1<1)||(i13.u68.AskForSection_1_1<1)))&&((i13.u68.Turn_1_1<1)||(i13.u37.AskForSection_0_1<1)))&&((i8.u9.AskForSection_1_0<1)||(i8.u36.Turn_0_3<1)))&&((i13.u68.Turn_1_1<1)||(i13.u49.AskForSection_3_1<1)))&&((i13.u37.Turn_1_0<1)||(i13.u49.AskForSection_3_1<1)))&&((i13.u37.AskForSection_0_1<1)||(i13.u49.Turn_1_3<1)))&&((i13.u68.Turn_1_1<1)||(i13.u50.AskForSection_2_1<1)))")
[2020-05-21 01:16:24] [INFO ] Computation of co-enabling matrix(86/332) took 88352 ms. Total solver calls (SAT/UNSAT): 7110(429/6681)
[2020-05-21 01:16:27] [INFO ] Computation of co-enabling matrix(89/332) took 91498 ms. Total solver calls (SAT/UNSAT): 7309(438/6871)
[2020-05-21 01:16:31] [INFO ] Computation of co-enabling matrix(92/332) took 95157 ms. Total solver calls (SAT/UNSAT): 7524(456/7068)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
950 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.269,732328,1,0,974587,9533,5157,4.99841e+06,535,65224,2435580
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-PT-3-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((G((F("((((((((i13.u37.EndTurn_0_1>=1)||(i8.u8.EndTurn_2_0>=1))||(i8.u7.EndTurn_3_0>=1))||(i8.u9.EndTurn_1_0>=1))||(i13.u50.EndTurn_2_1>=1))||(i13.u49.EndTurn_3_1>=1))||(i13.u68.EndTurn_1_1>=1))||(i8.u36.EndTurn_0_0>=1))"))U("((((((((((((i10.i0.u24.TestIdentity_1_2_1>=1)||(i6.i2.u26.TestIdentity_2_2_2>=1))||(i12.i0.u44.TestIdentity_0_2_0>=1))||(i4.u5.TestIdentity_3_0_3>=1))||(i0.i1.u65.TestIdentity_3_2_3>=1))||(i2.u4.TestIdentity_2_1_2>=1))||(i3.u6.TestIdentity_3_1_3>=1))||(i9.i0.u2.TestIdentity_1_0_1>=1))||(i7.u22.TestIdentity_2_0_2>=1))||(i11.i0.u51.TestIdentity_0_0_0>=1))||(i1.u3.TestIdentity_1_1_1>=1))||(i5.i0.u11.TestIdentity_0_1_0>=1))")))U(G(((((((((((((((((((((((((((((((((((((X("(((((((((((((((((((((((((((((((((((((((((((((((((i8.u36.Turn_0_1>=1)&&(i8.u8.AskForSection_2_0>=1))||((i8.u36.Turn_0_0>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i12.i1.u67.AskForSection_0_2>=1)&&(i0.i1.u52.Turn_2_3>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i8.u7.AskForSection_3_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i13.u50.AskForSection_2_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u49.AskForSection_3_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i8.u8.AskForSection_2_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i8.u36.AskForSection_0_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u68.AskForSection_1_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u9.AskForSection_1_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.AskForSection_0_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u50.AskForSection_2_1>=1)))"))||("(i11.i1.u62.TestIdentity_0_0_3>=1)"))||("(i10.i0.u38.TestIdentity_1_2_2>=1)"))||("(i12.i1.u18.TestIdentity_0_2_2>=1)"))||("(i1.u17.TestIdentity_1_1_2>=1)"))||("(i0.i1.u23.TestIdentity_3_2_2>=1)"))||("(i5.i1.u19.TestIdentity_0_1_2>=1)"))||("(i9.i0.u63.TestIdentity_1_0_2>=1)"))||("(i3.u29.TestIdentity_3_1_2>=1)"))||("(i4.u20.TestIdentity_3_0_2>=1)"))||("(i6.i2.u35.TestIdentity_2_2_3>=1)"))||("(i10.i1.u64.TestIdentity_1_2_3>=1)"))||("(i2.u40.TestIdentity_2_1_3>=1)"))||("(i1.u66.TestIdentity_1_1_3>=1)"))||("(i8.u41.TestIdentity_3_0_0>=1)"))||("(i8.u42.TestIdentity_2_0_0>=1)"))||("(i12.i1.u27.TestIdentity_0_2_3>=1)"))||("(i13.u45.TestIdentity_3_1_0>=1)"))||("(i13.u46.TestIdentity_2_1_0>=1)"))||("(i8.u43.TestIdentity_1_0_0>=1)"))||("(i13.u47.TestIdentity_1_1_0>=1)"))||("(i12.i0.u54.TestIdentity_0_2_1>=1)"))||("(i3.u32.TestIdentity_3_1_1>=1)"))||("(i11.i1.u56.TestIdentity_0_0_2>=1)"))||("(i0.i0.u55.TestIdentity_3_2_1>=1)"))||("(i2.u33.TestIdentity_2_1_1>=1)"))||("(i10.i1.u59.TestIdentity_1_2_0>=1)"))||("(i11.i0.u58.TestIdentity_0_0_1>=1)"))||("(i0.i1.u57.TestIdentity_3_2_0>=1)"))||("(i6.i1.u34.TestIdentity_2_2_1>=1)"))||("(i5.i0.u30.TestIdentity_0_1_1>=1)"))||("(i4.u31.TestIdentity_3_0_1>=1)"))||("(i6.i0.u13.TestIdentity_2_2_0>=1)"))||("(i5.i1.u21.TestIdentity_0_1_3>=1)"))||("(i9.i1.u61.TestIdentity_1_0_3>=1)"))||("(i7.u39.TestIdentity_2_0_3>=1)"))||("(i7.u60.TestIdentity_2_0_1>=1)"))))))
Formula 4 simplified : !G(G(F"((((((((i13.u37.EndTurn_0_1>=1)||(i8.u8.EndTurn_2_0>=1))||(i8.u7.EndTurn_3_0>=1))||(i8.u9.EndTurn_1_0>=1))||(i13.u50.EndTurn_2_1>=1))||(i13.u49.EndTurn_3_1>=1))||(i13.u68.EndTurn_1_1>=1))||(i8.u36.EndTurn_0_0>=1))" U "((((((((((((i10.i0.u24.TestIdentity_1_2_1>=1)||(i6.i2.u26.TestIdentity_2_2_2>=1))||(i12.i0.u44.TestIdentity_0_2_0>=1))||(i4.u5.TestIdentity_3_0_3>=1))||(i0.i1.u65.TestIdentity_3_2_3>=1))||(i2.u4.TestIdentity_2_1_2>=1))||(i3.u6.TestIdentity_3_1_3>=1))||(i9.i0.u2.TestIdentity_1_0_1>=1))||(i7.u22.TestIdentity_2_0_2>=1))||(i11.i0.u51.TestIdentity_0_0_0>=1))||(i1.u3.TestIdentity_1_1_1>=1))||(i5.i0.u11.TestIdentity_0_1_0>=1))") U G("(i0.i0.u55.TestIdentity_3_2_1>=1)" | "(i0.i1.u23.TestIdentity_3_2_2>=1)" | "(i0.i1.u57.TestIdentity_3_2_0>=1)" | "(i1.u17.TestIdentity_1_1_2>=1)" | "(i1.u66.TestIdentity_1_1_3>=1)" | "(i2.u33.TestIdentity_2_1_1>=1)" | "(i2.u40.TestIdentity_2_1_3>=1)" | "(i3.u29.TestIdentity_3_1_2>=1)" | "(i3.u32.TestIdentity_3_1_1>=1)" | "(i4.u20.TestIdentity_3_0_2>=1)" | "(i4.u31.TestIdentity_3_0_1>=1)" | "(i5.i0.u30.TestIdentity_0_1_1>=1)" | "(i5.i1.u19.TestIdentity_0_1_2>=1)" | "(i5.i1.u21.TestIdentity_0_1_3>=1)" | "(i6.i0.u13.TestIdentity_2_2_0>=1)" | "(i6.i1.u34.TestIdentity_2_2_1>=1)" | "(i6.i2.u35.TestIdentity_2_2_3>=1)" | "(i7.u39.TestIdentity_2_0_3>=1)" | "(i7.u60.TestIdentity_2_0_1>=1)" | "(i8.u41.TestIdentity_3_0_0>=1)" | "(i8.u42.TestIdentity_2_0_0>=1)" | "(i8.u43.TestIdentity_1_0_0>=1)" | "(i9.i0.u63.TestIdentity_1_0_2>=1)" | "(i9.i1.u61.TestIdentity_1_0_3>=1)" | "(i10.i0.u38.TestIdentity_1_2_2>=1)" | "(i10.i1.u59.TestIdentity_1_2_0>=1)" | "(i10.i1.u64.TestIdentity_1_2_3>=1)" | "(i11.i0.u58.TestIdentity_0_0_1>=1)" | "(i11.i1.u56.TestIdentity_0_0_2>=1)" | "(i11.i1.u62.TestIdentity_0_0_3>=1)" | "(i12.i0.u54.TestIdentity_0_2_1>=1)" | "(i12.i1.u18.TestIdentity_0_2_2>=1)" | "(i12.i1.u27.TestIdentity_0_2_3>=1)" | "(i13.u45.TestIdentity_3_1_0>=1)" | "(i13.u46.TestIdentity_2_1_0>=1)" | "(i13.u47.TestIdentity_1_1_0>=1)" | X"(((((((((((((((((((((((((((((((((((((((((((((((((i8.u36.Turn_0_1>=1)&&(i8.u8.AskForSection_2_0>=1))||((i8.u36.Turn_0_0>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i12.i1.u67.AskForSection_0_2>=1)&&(i0.i1.u52.Turn_2_3>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i8.u36.Turn_0_0>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i8.u7.AskForSection_3_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u36.Turn_0_1>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u50.Turn_1_2>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i13.u50.AskForSection_2_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u49.AskForSection_3_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i8.u8.AskForSection_2_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u36.AskForSection_0_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u9.AskForSection_1_0>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u8.AskForSection_2_0>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i8.u36.Turn_0_2>=1)&&(i8.u7.AskForSection_3_0>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i10.i1.u53.Turn_2_1>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i8.u36.AskForSection_0_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i6.i0.u71.Turn_2_2>=1)&&(i12.i1.u67.AskForSection_0_2>=1)))||((i13.u68.AskForSection_1_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i0.i1.u52.Turn_2_3>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u50.AskForSection_2_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i0.i1.u52.AskForSection_3_2>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i10.i1.u53.AskForSection_1_2>=1)))||((i12.i1.u67.Turn_2_0>=1)&&(i6.i0.u71.AskForSection_2_2>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u68.AskForSection_1_1>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u37.AskForSection_0_1>=1)))||((i8.u9.AskForSection_1_0>=1)&&(i8.u36.Turn_0_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.Turn_1_0>=1)&&(i13.u49.AskForSection_3_1>=1)))||((i13.u37.AskForSection_0_1>=1)&&(i13.u49.Turn_1_3>=1)))||((i13.u68.Turn_1_1>=1)&&(i13.u50.AskForSection_2_1>=1)))"))
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
ITS-tools command line returned an error code 134
[2020-05-21 01:16:32] [INFO ] Flatten gal took : 62 ms
[2020-05-21 01:16:32] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-21 01:16:32] [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, --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 --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((G((G((F("((((((((EndTurn_0_1>=1)||(EndTurn_2_0>=1))||(EndTurn_3_0>=1))||(EndTurn_1_0>=1))||(EndTurn_2_1>=1))||(EndTurn_3_1>=1))||(EndTurn_1_1>=1))||(EndTurn_0_0>=1))"))U("((((((((((((TestIdentity_1_2_1>=1)||(TestIdentity_2_2_2>=1))||(TestIdentity_0_2_0>=1))||(TestIdentity_3_0_3>=1))||(TestIdentity_3_2_3>=1))||(TestIdentity_2_1_2>=1))||(TestIdentity_3_1_3>=1))||(TestIdentity_1_0_1>=1))||(TestIdentity_2_0_2>=1))||(TestIdentity_0_0_0>=1))||(TestIdentity_1_1_1>=1))||(TestIdentity_0_1_0>=1))")))U(G(((((((((((((((((((((((((((((((((((((X("(((((((((((((((((((((((((((((((((((((((((((((((((Turn_0_1>=1)&&(AskForSection_2_0>=1))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((AskForSection_0_2>=1)&&(Turn_2_3>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((AskForSection_3_0>=1)&&(Turn_0_3>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((AskForSection_2_1>=1)&&(Turn_1_3>=1)))||((AskForSection_3_1>=1)&&(Turn_1_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_3>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((AskForSection_0_0>=1)&&(Turn_0_3>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((AskForSection_1_1>=1)&&(Turn_1_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_3>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_1>=1)&&(Turn_1_3>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))"))||("(TestIdentity_0_0_3>=1)"))||("(TestIdentity_1_2_2>=1)"))||("(TestIdentity_0_2_2>=1)"))||("(TestIdentity_1_1_2>=1)"))||("(TestIdentity_3_2_2>=1)"))||("(TestIdentity_0_1_2>=1)"))||("(TestIdentity_1_0_2>=1)"))||("(TestIdentity_3_1_2>=1)"))||("(TestIdentity_3_0_2>=1)"))||("(TestIdentity_2_2_3>=1)"))||("(TestIdentity_1_2_3>=1)"))||("(TestIdentity_2_1_3>=1)"))||("(TestIdentity_1_1_3>=1)"))||("(TestIdentity_3_0_0>=1)"))||("(TestIdentity_2_0_0>=1)"))||("(TestIdentity_0_2_3>=1)"))||("(TestIdentity_3_1_0>=1)"))||("(TestIdentity_2_1_0>=1)"))||("(TestIdentity_1_0_0>=1)"))||("(TestIdentity_1_1_0>=1)"))||("(TestIdentity_0_2_1>=1)"))||("(TestIdentity_3_1_1>=1)"))||("(TestIdentity_0_0_2>=1)"))||("(TestIdentity_3_2_1>=1)"))||("(TestIdentity_2_1_1>=1)"))||("(TestIdentity_1_2_0>=1)"))||("(TestIdentity_0_0_1>=1)"))||("(TestIdentity_3_2_0>=1)"))||("(TestIdentity_2_2_1>=1)"))||("(TestIdentity_0_1_1>=1)"))||("(TestIdentity_3_0_1>=1)"))||("(TestIdentity_2_2_0>=1)"))||("(TestIdentity_0_1_3>=1)"))||("(TestIdentity_1_0_3>=1)"))||("(TestIdentity_2_0_3>=1)"))||("(TestIdentity_2_0_1>=1)"))))))
Formula 0 simplified : !G(G(F"((((((((EndTurn_0_1>=1)||(EndTurn_2_0>=1))||(EndTurn_3_0>=1))||(EndTurn_1_0>=1))||(EndTurn_2_1>=1))||(EndTurn_3_1>=1))||(EndTurn_1_1>=1))||(EndTurn_0_0>=1))" U "((((((((((((TestIdentity_1_2_1>=1)||(TestIdentity_2_2_2>=1))||(TestIdentity_0_2_0>=1))||(TestIdentity_3_0_3>=1))||(TestIdentity_3_2_3>=1))||(TestIdentity_2_1_2>=1))||(TestIdentity_3_1_3>=1))||(TestIdentity_1_0_1>=1))||(TestIdentity_2_0_2>=1))||(TestIdentity_0_0_0>=1))||(TestIdentity_1_1_1>=1))||(TestIdentity_0_1_0>=1))") U G("(TestIdentity_0_0_1>=1)" | "(TestIdentity_0_0_2>=1)" | "(TestIdentity_0_0_3>=1)" | "(TestIdentity_0_1_1>=1)" | "(TestIdentity_0_1_2>=1)" | "(TestIdentity_0_1_3>=1)" | "(TestIdentity_0_2_1>=1)" | "(TestIdentity_0_2_2>=1)" | "(TestIdentity_0_2_3>=1)" | "(TestIdentity_1_0_0>=1)" | "(TestIdentity_1_0_2>=1)" | "(TestIdentity_1_0_3>=1)" | "(TestIdentity_1_1_0>=1)" | "(TestIdentity_1_1_2>=1)" | "(TestIdentity_1_1_3>=1)" | "(TestIdentity_1_2_0>=1)" | "(TestIdentity_1_2_2>=1)" | "(TestIdentity_1_2_3>=1)" | "(TestIdentity_2_0_0>=1)" | "(TestIdentity_2_0_1>=1)" | "(TestIdentity_2_0_3>=1)" | "(TestIdentity_2_1_0>=1)" | "(TestIdentity_2_1_1>=1)" | "(TestIdentity_2_1_3>=1)" | "(TestIdentity_2_2_0>=1)" | "(TestIdentity_2_2_1>=1)" | "(TestIdentity_2_2_3>=1)" | "(TestIdentity_3_0_0>=1)" | "(TestIdentity_3_0_1>=1)" | "(TestIdentity_3_0_2>=1)" | "(TestIdentity_3_1_0>=1)" | "(TestIdentity_3_1_1>=1)" | "(TestIdentity_3_1_2>=1)" | "(TestIdentity_3_2_0>=1)" | "(TestIdentity_3_2_1>=1)" | "(TestIdentity_3_2_2>=1)" | X"(((((((((((((((((((((((((((((((((((((((((((((((((Turn_0_1>=1)&&(AskForSection_2_0>=1))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((AskForSection_0_2>=1)&&(Turn_2_3>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((AskForSection_3_0>=1)&&(Turn_0_3>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((AskForSection_2_1>=1)&&(Turn_1_3>=1)))||((AskForSection_3_1>=1)&&(Turn_1_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_3>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((AskForSection_0_0>=1)&&(Turn_0_3>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((AskForSection_1_1>=1)&&(Turn_1_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_3>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_1>=1)&&(Turn_1_3>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))"))
ITS-tools command line returned an error code 134
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
[2020-05-21 01:16:33] [INFO ] Flatten gal took : 86 ms
[2020-05-21 01:16:33] [INFO ] Input system was already deterministic with 332 transitions.
[2020-05-21 01:16:33] [INFO ] Transformed 244 places.
[2020-05-21 01:16:33] [INFO ] Transformed 332 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-21 01:16:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
[2020-05-21 01:16:33] [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, --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 11 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G((F("((((((((EndTurn_0_1>=1)||(EndTurn_2_0>=1))||(EndTurn_3_0>=1))||(EndTurn_1_0>=1))||(EndTurn_2_1>=1))||(EndTurn_3_1>=1))||(EndTurn_1_1>=1))||(EndTurn_0_0>=1))"))U("((((((((((((TestIdentity_1_2_1>=1)||(TestIdentity_2_2_2>=1))||(TestIdentity_0_2_0>=1))||(TestIdentity_3_0_3>=1))||(TestIdentity_3_2_3>=1))||(TestIdentity_2_1_2>=1))||(TestIdentity_3_1_3>=1))||(TestIdentity_1_0_1>=1))||(TestIdentity_2_0_2>=1))||(TestIdentity_0_0_0>=1))||(TestIdentity_1_1_1>=1))||(TestIdentity_0_1_0>=1))")))U(G(((((((((((((((((((((((((((((((((((((X("(((((((((((((((((((((((((((((((((((((((((((((((((Turn_0_1>=1)&&(AskForSection_2_0>=1))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((AskForSection_0_2>=1)&&(Turn_2_3>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((AskForSection_3_0>=1)&&(Turn_0_3>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((AskForSection_2_1>=1)&&(Turn_1_3>=1)))||((AskForSection_3_1>=1)&&(Turn_1_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_3>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((AskForSection_0_0>=1)&&(Turn_0_3>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((AskForSection_1_1>=1)&&(Turn_1_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_3>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_1>=1)&&(Turn_1_3>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))"))||("(TestIdentity_0_0_3>=1)"))||("(TestIdentity_1_2_2>=1)"))||("(TestIdentity_0_2_2>=1)"))||("(TestIdentity_1_1_2>=1)"))||("(TestIdentity_3_2_2>=1)"))||("(TestIdentity_0_1_2>=1)"))||("(TestIdentity_1_0_2>=1)"))||("(TestIdentity_3_1_2>=1)"))||("(TestIdentity_3_0_2>=1)"))||("(TestIdentity_2_2_3>=1)"))||("(TestIdentity_1_2_3>=1)"))||("(TestIdentity_2_1_3>=1)"))||("(TestIdentity_1_1_3>=1)"))||("(TestIdentity_3_0_0>=1)"))||("(TestIdentity_2_0_0>=1)"))||("(TestIdentity_0_2_3>=1)"))||("(TestIdentity_3_1_0>=1)"))||("(TestIdentity_2_1_0>=1)"))||("(TestIdentity_1_0_0>=1)"))||("(TestIdentity_1_1_0>=1)"))||("(TestIdentity_0_2_1>=1)"))||("(TestIdentity_3_1_1>=1)"))||("(TestIdentity_0_0_2>=1)"))||("(TestIdentity_3_2_1>=1)"))||("(TestIdentity_2_1_1>=1)"))||("(TestIdentity_1_2_0>=1)"))||("(TestIdentity_0_0_1>=1)"))||("(TestIdentity_3_2_0>=1)"))||("(TestIdentity_2_2_1>=1)"))||("(TestIdentity_0_1_1>=1)"))||("(TestIdentity_3_0_1>=1)"))||("(TestIdentity_2_2_0>=1)"))||("(TestIdentity_0_1_3>=1)"))||("(TestIdentity_1_0_3>=1)"))||("(TestIdentity_2_0_3>=1)"))||("(TestIdentity_2_0_1>=1)"))))))
Formula 0 simplified : !G(G(F"((((((((EndTurn_0_1>=1)||(EndTurn_2_0>=1))||(EndTurn_3_0>=1))||(EndTurn_1_0>=1))||(EndTurn_2_1>=1))||(EndTurn_3_1>=1))||(EndTurn_1_1>=1))||(EndTurn_0_0>=1))" U "((((((((((((TestIdentity_1_2_1>=1)||(TestIdentity_2_2_2>=1))||(TestIdentity_0_2_0>=1))||(TestIdentity_3_0_3>=1))||(TestIdentity_3_2_3>=1))||(TestIdentity_2_1_2>=1))||(TestIdentity_3_1_3>=1))||(TestIdentity_1_0_1>=1))||(TestIdentity_2_0_2>=1))||(TestIdentity_0_0_0>=1))||(TestIdentity_1_1_1>=1))||(TestIdentity_0_1_0>=1))") U G("(TestIdentity_0_0_1>=1)" | "(TestIdentity_0_0_2>=1)" | "(TestIdentity_0_0_3>=1)" | "(TestIdentity_0_1_1>=1)" | "(TestIdentity_0_1_2>=1)" | "(TestIdentity_0_1_3>=1)" | "(TestIdentity_0_2_1>=1)" | "(TestIdentity_0_2_2>=1)" | "(TestIdentity_0_2_3>=1)" | "(TestIdentity_1_0_0>=1)" | "(TestIdentity_1_0_2>=1)" | "(TestIdentity_1_0_3>=1)" | "(TestIdentity_1_1_0>=1)" | "(TestIdentity_1_1_2>=1)" | "(TestIdentity_1_1_3>=1)" | "(TestIdentity_1_2_0>=1)" | "(TestIdentity_1_2_2>=1)" | "(TestIdentity_1_2_3>=1)" | "(TestIdentity_2_0_0>=1)" | "(TestIdentity_2_0_1>=1)" | "(TestIdentity_2_0_3>=1)" | "(TestIdentity_2_1_0>=1)" | "(TestIdentity_2_1_1>=1)" | "(TestIdentity_2_1_3>=1)" | "(TestIdentity_2_2_0>=1)" | "(TestIdentity_2_2_1>=1)" | "(TestIdentity_2_2_3>=1)" | "(TestIdentity_3_0_0>=1)" | "(TestIdentity_3_0_1>=1)" | "(TestIdentity_3_0_2>=1)" | "(TestIdentity_3_1_0>=1)" | "(TestIdentity_3_1_1>=1)" | "(TestIdentity_3_1_2>=1)" | "(TestIdentity_3_2_0>=1)" | "(TestIdentity_3_2_1>=1)" | "(TestIdentity_3_2_2>=1)" | X"(((((((((((((((((((((((((((((((((((((((((((((((((Turn_0_1>=1)&&(AskForSection_2_0>=1))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((AskForSection_0_2>=1)&&(Turn_2_3>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((AskForSection_3_0>=1)&&(Turn_0_3>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((AskForSection_2_1>=1)&&(Turn_1_3>=1)))||((AskForSection_3_1>=1)&&(Turn_1_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_3>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((AskForSection_0_0>=1)&&(Turn_0_3>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((AskForSection_1_1>=1)&&(Turn_1_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_3>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_1>=1)&&(Turn_1_3>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))"))
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
ITS-tools command line returned an error code 134
[2020-05-21 01:16:34] [INFO ] Computation of co-enabling matrix(96/332) took 98278 ms. Total solver calls (SAT/UNSAT): 7795(474/7321)
[2020-05-21 01:16:39] [INFO ] Computation of co-enabling matrix(100/332) took 103368 ms. Total solver calls (SAT/UNSAT): 8062(492/7570)
[2020-05-21 01:16:42] [INFO ] Computation of co-enabling matrix(103/332) took 107147 ms. Total solver calls (SAT/UNSAT): 8251(501/7750)
[2020-05-21 01:16:46] [INFO ] Computation of co-enabling matrix(106/332) took 110432 ms. Total solver calls (SAT/UNSAT): 8437(510/7927)
[2020-05-21 01:16:51] [INFO ] Computation of co-enabling matrix(108/332) took 115444 ms. Total solver calls (SAT/UNSAT): 8628(527/8101)
[2020-05-21 01:16:57] [INFO ] Computation of co-enabling matrix(111/332) took 121924 ms. Total solver calls (SAT/UNSAT): 8932(554/8378)
[2020-05-21 01:17:00] [INFO ] Computation of co-enabling matrix(112/332) took 125040 ms. Total solver calls (SAT/UNSAT): 9008(570/8438)
[2020-05-21 01:17:06] [INFO ] Computation of co-enabling matrix(114/332) took 131052 ms. Total solver calls (SAT/UNSAT): 9163(602/8561)
[2020-05-21 01:17:12] [INFO ] Computation of co-enabling matrix(117/332) took 136572 ms. Total solver calls (SAT/UNSAT): 9409(632/8777)
[2020-05-21 01:17:16] [INFO ] Computation of co-enabling matrix(118/332) took 140768 ms. Total solver calls (SAT/UNSAT): 9530(645/8885)
[2020-05-21 01:17:22] [INFO ] Computation of co-enabling matrix(120/332) took 146199 ms. Total solver calls (SAT/UNSAT): 9749(657/9092)
[2020-05-21 01:17:25] [INFO ] Computation of co-enabling matrix(122/332) took 149575 ms. Total solver calls (SAT/UNSAT): 9913(668/9245)
[2020-05-21 01:17:29] [INFO ] Computation of co-enabling matrix(123/332) took 153225 ms. Total solver calls (SAT/UNSAT): 10030(678/9352)
[2020-05-21 01:17:32] [INFO ] Computation of co-enabling matrix(128/332) took 156963 ms. Total solver calls (SAT/UNSAT): 10310(696/9614)
[2020-05-21 01:17:36] [INFO ] Computation of co-enabling matrix(131/332) took 160501 ms. Total solver calls (SAT/UNSAT): 10491(720/9771)
[2020-05-21 01:17:40] [INFO ] Computation of co-enabling matrix(133/332) took 165048 ms. Total solver calls (SAT/UNSAT): 10622(745/9877)
[2020-05-21 01:17:44] [INFO ] Computation of co-enabling matrix(135/332) took 168216 ms. Total solver calls (SAT/UNSAT): 10744(765/9979)
[2020-05-21 01:17:47] [INFO ] Computation of co-enabling matrix(137/332) took 171808 ms. Total solver calls (SAT/UNSAT): 10909(784/10125)
[2020-05-21 01:17:52] [INFO ] Computation of co-enabling matrix(139/332) took 177080 ms. Total solver calls (SAT/UNSAT): 11113(799/10314)
[2020-05-21 01:18:03] [INFO ] Computation of co-enabling matrix(141/332) took 187284 ms. Total solver calls (SAT/UNSAT): 11274(863/10411)
[2020-05-21 01:18:11] [INFO ] Computation of co-enabling matrix(142/332) took 195439 ms. Total solver calls (SAT/UNSAT): 11371(915/10456)
[2020-05-21 01:18:18] [INFO ] Computation of co-enabling matrix(144/332) took 203028 ms. Total solver calls (SAT/UNSAT): 11575(1021/10554)
[2020-05-21 01:18:24] [INFO ] Computation of co-enabling matrix(145/332) took 208580 ms. Total solver calls (SAT/UNSAT): 11670(1072/10598)
[2020-05-21 01:18:29] [INFO ] Computation of co-enabling matrix(147/332) took 213744 ms. Total solver calls (SAT/UNSAT): 11829(1134/10695)
[2020-05-21 01:18:37] [INFO ] Computation of co-enabling matrix(148/332) took 222043 ms. Total solver calls (SAT/UNSAT): 11930(1187/10743)
[2020-05-21 01:18:45] [INFO ] Computation of co-enabling matrix(149/332) took 229575 ms. Total solver calls (SAT/UNSAT): 12022(1236/10786)
[2020-05-21 01:18:49] [INFO ] Computation of co-enabling matrix(151/332) took 233864 ms. Total solver calls (SAT/UNSAT): 12176(1296/10880)
[2020-05-21 01:18:54] [INFO ] Computation of co-enabling matrix(154/332) took 238317 ms. Total solver calls (SAT/UNSAT): 12340(1317/11023)
[2020-05-21 01:18:58] [INFO ] Computation of co-enabling matrix(156/332) took 242388 ms. Total solver calls (SAT/UNSAT): 12485(1328/11157)
[2020-05-21 01:19:02] [INFO ] Computation of co-enabling matrix(158/332) took 247048 ms. Total solver calls (SAT/UNSAT): 12632(1345/11287)
[2020-05-21 01:19:06] [INFO ] Computation of co-enabling matrix(161/332) took 250595 ms. Total solver calls (SAT/UNSAT): 12814(1355/11459)
[2020-05-21 01:19:09] [INFO ] Computation of co-enabling matrix(163/332) took 253619 ms. Total solver calls (SAT/UNSAT): 12912(1369/11543)
[2020-05-21 01:19:12] [INFO ] Computation of co-enabling matrix(166/332) took 256959 ms. Total solver calls (SAT/UNSAT): 13055(1384/11671)
[2020-05-21 01:19:16] [INFO ] Computation of co-enabling matrix(168/332) took 260422 ms. Total solver calls (SAT/UNSAT): 13190(1399/11791)
[2020-05-21 01:19:19] [INFO ] Computation of co-enabling matrix(171/332) took 263944 ms. Total solver calls (SAT/UNSAT): 13394(1406/11988)
[2020-05-21 01:19:23] [INFO ] Computation of co-enabling matrix(175/332) took 267524 ms. Total solver calls (SAT/UNSAT): 13559(1415/12144)
[2020-05-21 01:19:27] [INFO ] Computation of co-enabling matrix(180/332) took 271504 ms. Total solver calls (SAT/UNSAT): 13760(1427/12333)
[2020-05-21 01:19:30] [INFO ] Computation of co-enabling matrix(184/332) took 275020 ms. Total solver calls (SAT/UNSAT): 13916(1436/12480)
[2020-05-21 01:19:34] [INFO ] Computation of co-enabling matrix(188/332) took 278731 ms. Total solver calls (SAT/UNSAT): 14071(1447/12624)
[2020-05-21 01:19:40] [INFO ] Computation of co-enabling matrix(192/332) took 284268 ms. Total solver calls (SAT/UNSAT): 14263(1497/12766)
[2020-05-21 01:19:45] [INFO ] Computation of co-enabling matrix(193/332) took 289650 ms. Total solver calls (SAT/UNSAT): 14334(1533/12801)
[2020-05-21 01:19:51] [INFO ] Computation of co-enabling matrix(194/332) took 295323 ms. Total solver calls (SAT/UNSAT): 14404(1570/12834)
[2020-05-21 01:19:59] [INFO ] Computation of co-enabling matrix(197/332) took 303389 ms. Total solver calls (SAT/UNSAT): 14575(1639/12936)
[2020-05-21 01:20:04] [INFO ] Computation of co-enabling matrix(198/332) took 308554 ms. Total solver calls (SAT/UNSAT): 14642(1674/12968)
[2020-05-21 01:20:07] [INFO ] Computation of co-enabling matrix(201/332) took 311799 ms. Total solver calls (SAT/UNSAT): 14774(1707/13067)
[2020-05-21 01:20:11] [INFO ] Computation of co-enabling matrix(202/332) took 316091 ms. Total solver calls (SAT/UNSAT): 14838(1739/13099)
[2020-05-21 01:20:16] [INFO ] Computation of co-enabling matrix(203/332) took 320664 ms. Total solver calls (SAT/UNSAT): 14901(1770/13131)
[2020-05-21 01:20:20] [INFO ] Computation of co-enabling matrix(209/332) took 324507 ms. Total solver calls (SAT/UNSAT): 15109(1776/13333)
[2020-05-21 01:20:23] [INFO ] Computation of co-enabling matrix(217/332) took 327880 ms. Total solver calls (SAT/UNSAT): 15341(1776/13565)
[2020-05-21 01:20:26] [INFO ] Computation of co-enabling matrix(225/332) took 330995 ms. Total solver calls (SAT/UNSAT): 15557(1776/13781)
[2020-05-21 01:20:30] [INFO ] Computation of co-enabling matrix(233/332) took 334396 ms. Total solver calls (SAT/UNSAT): 15757(1776/13981)
[2020-05-21 01:20:33] [INFO ] Computation of co-enabling matrix(237/332) took 337808 ms. Total solver calls (SAT/UNSAT): 15893(1787/14106)
[2020-05-21 01:20:37] [INFO ] Computation of co-enabling matrix(240/332) took 341192 ms. Total solver calls (SAT/UNSAT): 16019(1802/14217)
[2020-05-21 01:20:41] [INFO ] Computation of co-enabling matrix(244/332) took 345564 ms. Total solver calls (SAT/UNSAT): 16179(1823/14356)
[2020-05-21 01:20:44] [INFO ] Computation of co-enabling matrix(249/332) took 349032 ms. Total solver calls (SAT/UNSAT): 16390(1849/14541)
[2020-05-21 01:20:48] [INFO ] Computation of co-enabling matrix(252/332) took 352629 ms. Total solver calls (SAT/UNSAT): 16505(1863/14642)
[2020-05-21 01:20:52] [INFO ] Computation of co-enabling matrix(256/332) took 356308 ms. Total solver calls (SAT/UNSAT): 16660(1883/14777)
[2020-05-21 01:20:56] [INFO ] Computation of co-enabling matrix(260/332) took 360255 ms. Total solver calls (SAT/UNSAT): 16800(1901/14899)
[2020-05-21 01:20:59] [INFO ] Computation of co-enabling matrix(263/332) took 363260 ms. Total solver calls (SAT/UNSAT): 16909(1916/14993)
[2020-05-21 01:21:02] [INFO ] Computation of co-enabling matrix(267/332) took 366836 ms. Total solver calls (SAT/UNSAT): 17038(1935/15103)
[2020-05-21 01:21:06] [INFO ] Computation of co-enabling matrix(272/332) took 370476 ms. Total solver calls (SAT/UNSAT): 17177(1951/15226)
[2020-05-21 01:21:09] [INFO ] Computation of co-enabling matrix(278/332) took 373652 ms. Total solver calls (SAT/UNSAT): 17313(1964/15349)
[2020-05-21 01:21:13] [INFO ] Computation of co-enabling matrix(287/332) took 377390 ms. Total solver calls (SAT/UNSAT): 17473(1976/15497)
[2020-05-21 01:21:16] [INFO ] Computation of co-enabling matrix(292/332) took 380567 ms. Total solver calls (SAT/UNSAT): 17588(1991/15597)
[2020-05-21 01:21:19] [INFO ] Computation of co-enabling matrix(300/332) took 383796 ms. Total solver calls (SAT/UNSAT): 17711(2001/15710)
[2020-05-21 01:21:22] [INFO ] Computation of co-enabling matrix(308/332) took 387056 ms. Total solver calls (SAT/UNSAT): 17809(2013/15796)
[2020-05-21 01:21:26] [INFO ] Computation of co-enabling matrix(317/332) took 390491 ms. Total solver calls (SAT/UNSAT): 17903(2027/15876)
[2020-05-21 01:21:29] [INFO ] Computation of co-enabling matrix(327/332) took 393560 ms. Total solver calls (SAT/UNSAT): 17965(2040/15925)
[2020-05-21 01:21:29] [INFO ] Computation of Finished co-enabling matrix. took 394144 ms. Total solver calls (SAT/UNSAT): 17968(2043/15925)
[2020-05-21 01:21:30] [INFO ] Computing Do-Not-Accords matrix : 332 transitions.
[2020-05-21 01:21:30] [INFO ] Computation of Completed DNA matrix. took 572 ms. Total solver calls (SAT/UNSAT): 36(0/36)
[2020-05-21 01:21:30] [INFO ] Built C files in 421409ms 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 6021 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 128 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](([]((<>((LTLAP5==true)))U((LTLAP19==true))))U([](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( X((LTLAP2==true))) || ( (LTLAP20==true)) ) || ( (LTLAP21==true)) ) || ( (LTLAP22==true)) ) || ( (LTLAP23==true)) ) || ( (LTLAP24==true)) ) || ( (LTLAP25==true)) ) || ( (LTLAP26==true)) ) || ( (LTLAP27==true)) ) || ( (LTLAP28==true)) ) || ( (LTLAP29==true)) ) || ( (LTLAP30==true)) ) || ( (LTLAP31==true)) ) || ( (LTLAP32==true)) ) || ( (LTLAP33==true)) ) || ( (LTLAP34==true)) ) || ( (LTLAP35==true)) ) || ( (LTLAP36==true)) ) || ( (LTLAP37==true)) ) || ( (LTLAP38==true)) ) || ( (LTLAP39==true)) ) || ( (LTLAP40==true)) ) || ( (LTLAP41==true)) ) || ( (LTLAP42==true)) ) || ( (LTLAP43==true)) ) || ( (LTLAP44==true)) ) || ( (LTLAP45==true)) ) || ( (LTLAP46==true)) ) || ( (LTLAP47==true)) ) || ( (LTLAP48==true)) ) || ( (LTLAP49==true)) ) || ( (LTLAP50==true)) ) || ( (LTLAP51==true)) ) || ( (LTLAP52==true)) ) || ( (LTLAP53==true)) ) || ( (LTLAP54==true)) ) || ( (LTLAP55==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, [](([]((<>((LTLAP5==true)))U((LTLAP19==true))))U([](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( X((LTLAP2==true))) || ( (LTLAP20==true)) ) || ( (LTLAP21==true)) ) || ( (LTLAP22==true)) ) || ( (LTLAP23==true)) ) || ( (LTLAP24==true)) ) || ( (LTLAP25==true)) ) || ( (LTLAP26==true)) ) || ( (LTLAP27==true)) ) || ( (LTLAP28==true)) ) || ( (LTLAP29==true)) ) || ( (LTLAP30==true)) ) || ( (LTLAP31==true)) ) || ( (LTLAP32==true)) ) || ( (LTLAP33==true)) ) || ( (LTLAP34==true)) ) || ( (LTLAP35==true)) ) || ( (LTLAP36==true)) ) || ( (LTLAP37==true)) ) || ( (LTLAP38==true)) ) || ( (LTLAP39==true)) ) || ( (LTLAP40==true)) ) || ( (LTLAP41==true)) ) || ( (LTLAP42==true)) ) || ( (LTLAP43==true)) ) || ( (LTLAP44==true)) ) || ( (LTLAP45==true)) ) || ( (LTLAP46==true)) ) || ( (LTLAP47==true)) ) || ( (LTLAP48==true)) ) || ( (LTLAP49==true)) ) || ( (LTLAP50==true)) ) || ( (LTLAP51==true)) ) || ( (LTLAP52==true)) ) || ( (LTLAP53==true)) ) || ( (LTLAP54==true)) ) || ( (LTLAP55==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, [](([]((<>((LTLAP5==true)))U((LTLAP19==true))))U([](( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( X((LTLAP2==true))) || ( (LTLAP20==true)) ) || ( (LTLAP21==true)) ) || ( (LTLAP22==true)) ) || ( (LTLAP23==true)) ) || ( (LTLAP24==true)) ) || ( (LTLAP25==true)) ) || ( (LTLAP26==true)) ) || ( (LTLAP27==true)) ) || ( (LTLAP28==true)) ) || ( (LTLAP29==true)) ) || ( (LTLAP30==true)) ) || ( (LTLAP31==true)) ) || ( (LTLAP32==true)) ) || ( (LTLAP33==true)) ) || ( (LTLAP34==true)) ) || ( (LTLAP35==true)) ) || ( (LTLAP36==true)) ) || ( (LTLAP37==true)) ) || ( (LTLAP38==true)) ) || ( (LTLAP39==true)) ) || ( (LTLAP40==true)) ) || ( (LTLAP41==true)) ) || ( (LTLAP42==true)) ) || ( (LTLAP43==true)) ) || ( (LTLAP44==true)) ) || ( (LTLAP45==true)) ) || ( (LTLAP46==true)) ) || ( (LTLAP47==true)) ) || ( (LTLAP48==true)) ) || ( (LTLAP49==true)) ) || ( (LTLAP50==true)) ) || ( (LTLAP51==true)) ) || ( (LTLAP52==true)) ) || ( (LTLAP53==true)) ) || ( (LTLAP54==true)) ) || ( (LTLAP55==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)

BK_STOP 1590024097947

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r111-csrt-158961258000714"
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 [ "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 ;