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-158961258000705.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-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 98K 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-2-00
FORMULA_NAME Peterson-PT-2-01
FORMULA_NAME Peterson-PT-2-02
FORMULA_NAME Peterson-PT-2-03
FORMULA_NAME Peterson-PT-2-04
FORMULA_NAME Peterson-PT-2-05
FORMULA_NAME Peterson-PT-2-06
FORMULA_NAME Peterson-PT-2-07
FORMULA_NAME Peterson-PT-2-08
FORMULA_NAME Peterson-PT-2-09
FORMULA_NAME Peterson-PT-2-10
FORMULA_NAME Peterson-PT-2-11
FORMULA_NAME Peterson-PT-2-12
FORMULA_NAME Peterson-PT-2-13
FORMULA_NAME Peterson-PT-2-14
FORMULA_NAME Peterson-PT-2-15

=== Now, execution of the tool begins

BK_START 1590022856924

[2020-05-21 01:00:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 01:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:00:59] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2020-05-21 01:00:59] [INFO ] Transformed 102 places.
[2020-05-21 01:00:59] [INFO ] Transformed 126 transitions.
[2020-05-21 01:00:59] [INFO ] Parsed PT model containing 102 places and 126 transitions in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 79 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 265 ms. (steps per millisecond=377 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1]
[2020-05-21 01:01:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-05-21 01:01:00] [INFO ] Computed 11 place invariants in 8 ms
[2020-05-21 01:01:00] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2020-05-21 01:01:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:00] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2020-05-21 01:01:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-21 01:01:00] [INFO ] [Real]Added 26 Read/Feed constraints in 28 ms returned sat
[2020-05-21 01:01:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2020-05-21 01:01:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 7 ms returned sat
[2020-05-21 01:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:01] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-05-21 01:01:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:01] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-05-21 01:01:01] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2020-05-21 01:01:01] [INFO ] Deduced a trap composed of 8 places in 248 ms
[2020-05-21 01:01:01] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2020-05-21 01:01:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 836 ms
[2020-05-21 01:01:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2020-05-21 01:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:02] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:02] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-05-21 01:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2020-05-21 01:01:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 19 ms.
[2020-05-21 01:01:02] [INFO ] Added : 112 causal constraints over 23 iterations in 460 ms. Result :sat
[2020-05-21 01:01:02] [INFO ] Deduced a trap composed of 25 places in 52 ms
[2020-05-21 01:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2020-05-21 01:01:03] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:03] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-21 01:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:03] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:01:03] [INFO ] Deduced a trap composed of 8 places in 130 ms
[2020-05-21 01:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2020-05-21 01:01:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 33 ms.
[2020-05-21 01:01:03] [INFO ] Added : 115 causal constraints over 24 iterations in 363 ms. Result :sat
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 32 places in 80 ms
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2020-05-21 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-21 01:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2020-05-21 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-21 01:01:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-05-21 01:01:04] [INFO ] Added : 117 causal constraints over 24 iterations in 278 ms. Result :sat
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2020-05-21 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Added 26 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-05-21 01:01:05] [INFO ] Added : 112 causal constraints over 23 iterations in 321 ms. Result :sat
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-05-21 01:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-21 01:01:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-05-21 01:01:05] [INFO ] Added : 113 causal constraints over 23 iterations in 217 ms. Result :sat
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-21 01:01:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-05-21 01:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 42 places in 55 ms
[2020-05-21 01:01:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 260 ms
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using 8 positive place invariants in 55 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-05-21 01:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-21 01:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-05-21 01:01:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-05-21 01:01:07] [INFO ] Added : 117 causal constraints over 24 iterations in 247 ms. Result :sat
[2020-05-21 01:01:07] [INFO ] Deduced a trap composed of 32 places in 41 ms
[2020-05-21 01:01:07] [INFO ] Deduced a trap composed of 29 places in 22 ms
[2020-05-21 01:01:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2020-05-21 01:01:07] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2020-05-21 01:01:07] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-21 01:01:07] [INFO ] Flatten gal took : 74 ms
FORMULA Peterson-PT-2-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:01:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-21 01:01:07] [INFO ] Flatten gal took : 22 ms
[2020-05-21 01:01:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-2-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:01:07] [INFO ] Applying decomposition
[2020-05-21 01:01:07] [INFO ] Flatten gal took : 11 ms
[2020-05-21 01:01:07] [INFO ] Input system was already deterministic with 126 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 120 out of 126 initially.
// Phase 1: matrix 120 rows 102 cols
[2020-05-21 01:01:07] [INFO ] Computed 11 place invariants in 4 ms
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + EndTurn_2_0 + EndTurn_2_1 + BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_0_2 + BeginLoop_2_1_2 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_1_1 + TestAlone_2_0_1 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_0 + TestIdentity_2_0_1 + TestIdentity_2_1_0 + TestIdentity_2_1_2 + TestIdentity_2_1_1 + TestIdentity_2_0_2 + Idle_2 + AskForSection_2_1 + AskForSection_2_0 + CS_2 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + EndTurn_1_0 + EndTurn_1_1 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_0_2 + TestAlone_1_0_0 + TestAlone_1_1_0 + TestAlone_1_1_2 + TestAlone_1_0_2 + TestIdentity_1_0_0 + TestTurn_1_0 + TestTurn_1_1 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_1_0 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + Idle_1 + CS_1 + AskForSection_1_1 + AskForSection_1_0 = 1
inv : WantSection_1_T + Idle_1 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + EndTurn_0_0 + EndTurn_0_1 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestTurn_0_0 + TestAlone_0_1_2 + TestIdentity_0_0_0 + TestTurn_0_1 + TestIdentity_0_1_1 + TestIdentity_0_1_0 + TestIdentity_0_0_1 + TestIdentity_0_1_2 + TestIdentity_0_0_2 + Idle_0 + CS_0 + AskForSection_0_1 + AskForSection_0_0 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : Turn_1_2 + Turn_1_0 + Turn_1_1 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : Turn_0_0 + Turn_0_1 + Turn_0_2 = 1
inv : WantSection_1_F - Idle_1 = 0
Total of 11 invariants.
[2020-05-21 01:01:07] [INFO ] Computed 11 place invariants in 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph5035941861422308583.txt, -o, /tmp/graph5035941861422308583.bin, -w, /tmp/graph5035941861422308583.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/graph5035941861422308583.bin, -l, -1, -v, -w, /tmp/graph5035941861422308583.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:01:08] [INFO ] Decomposing Gal with order
[2020-05-21 01:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:01:08] [INFO ] Removed a total of 35 redundant transitions.
[2020-05-21 01:01:08] [INFO ] Flatten gal took : 201 ms
[2020-05-21 01:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 7 ms.
[2020-05-21 01:01:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-21 01:01:08] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !(((!(X(X(F(X("(((gu4.Idle_0+gu4.Idle_2)+gu4.Idle_1)>=3)"))))))||(!(G(X("((((((gu5.AskForSection_1_1+gu5.AskForSection_2_1)+gu5.AskForSection_2_0)+gu5.AskForSection_0_1)+gu5.AskForSection_0_0)+gu5.AskForSection_1_0)>=2)"))))))
Formula 0 simplified : !(!XXFX"(((gu4.Idle_0+gu4.Idle_2)+gu4.Idle_1)>=3)" | !GX"((((((gu5.AskForSection_1_1+gu5.AskForSection_2_1)+gu5.AskForSection_2_0)+gu5.AskForSection_0_1)+gu5.AskForSection_0_0)+gu5.AskForSection_1_0)>=2)")
[2020-05-21 01:01:09] [INFO ] Proved 102 variables to be positive in 1150 ms
[2020-05-21 01:01:09] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2020-05-21 01:01:09] [INFO ] Computation of disable matrix completed :0/126 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:01:09] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:01:09] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2020-05-21 01:01:09] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions gu0.EndLoop_1_0, gu0.EndLoop_2_0, gu0.EndLoop_0_0, gu5.UpdateTurn_0_0_0, gu5.UpdateTurn_2_0_0, gu5.UpdateTurn_0_2_1, gu5.UpdateTurn_1_2_1, gu5.UpdateTurn_1_0_1, gu5.UpdateTurn_1_1_1, gu5.UpdateTurn_0_1_1, gu5.UpdateTurn_0_2_0, gu5.UpdateTurn_0_0_1, gu5.UpdateTurn_2_2_0, NotAlone_0_2_0, NotAlone_2_1_0, NotAlone_1_2_0, NotAlone_2_1_1, NotAlone_0_2_1, NotAlone_1_2_1, UpdateTurn_1_0_0, UpdateTurn_1_1_0, UpdateTurn_2_1_0, UpdateTurn_2_1_1, BecomeIdle_2, BecomeIdle_1, BecomeIdle_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/92/26/118
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
142 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,1.48124,55492,1,0,234,170358,256,121,2939,141931,247
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Peterson-PT-2-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X((F("((((((gu0.EndTurn_0_0+gu0.EndTurn_2_0)+gu0.EndTurn_1_0)+gu0.EndTurn_1_1)+gu0.EndTurn_0_1)+gu0.EndTurn_2_1)<=(((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_1_2))"))U("((((((gu0.EndTurn_0_0+gu0.EndTurn_2_0)+gu0.EndTurn_1_0)+gu0.EndTurn_1_1)+gu0.EndTurn_0_1)+gu0.EndTurn_2_1)<=(((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_1_2))")))))
Formula 1 simplified : !GX(F"((((((gu0.EndTurn_0_0+gu0.EndTurn_2_0)+gu0.EndTurn_1_0)+gu0.EndTurn_1_1)+gu0.EndTurn_0_1)+gu0.EndTurn_2_1)<=(((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_1_2))" U "((((((gu0.EndTurn_0_0+gu0.EndTurn_2_0)+gu0.EndTurn_1_0)+gu0.EndTurn_1_1)+gu0.EndTurn_0_1)+gu0.EndTurn_2_1)<=(((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_1_2))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
83 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,2.31381,69148,1,0,252,224514,269,122,3261,216518,308
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-PT-2-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(!(G(F(F((G("((((((((((((((((((gu1.BeginLoop_0_0_0+gu1.BeginLoop_2_0_0)+gu1.BeginLoop_1_0_0)+gu1.BeginLoop_1_1_0)+gu1.BeginLoop_0_1_0)+gu1.BeginLoop_1_0_1)+gu1.BeginLoop_2_0_1)+gu1.BeginLoop_2_1_0)+gu1.BeginLoop_0_0_1)+gu1.BeginLoop_2_1_1)+gu1.BeginLoop_0_0_2)+gu1.BeginLoop_0_1_1)+gu1.BeginLoop_1_1_1)+gu1.BeginLoop_0_1_2)+gu1.BeginLoop_1_1_2)+gu1.BeginLoop_1_0_2)+gu1.BeginLoop_2_0_2)+gu1.BeginLoop_2_1_2)>=1)"))||("(((gu2.CS_0+gu2.CS_1)+gu2.CS_2)>=1)")))))))))
Formula 2 simplified : !XG!GF("(((gu2.CS_0+gu2.CS_1)+gu2.CS_2)>=1)" | G"((((((((((((((((((gu1.BeginLoop_0_0_0+gu1.BeginLoop_2_0_0)+gu1.BeginLoop_1_0_0)+gu1.BeginLoop_1_1_0)+gu1.BeginLoop_0_1_0)+gu1.BeginLoop_1_0_1)+gu1.BeginLoop_2_0_1)+gu1.BeginLoop_2_1_0)+gu1.BeginLoop_0_0_1)+gu1.BeginLoop_2_1_1)+gu1.BeginLoop_0_0_2)+gu1.BeginLoop_0_1_1)+gu1.BeginLoop_1_1_1)+gu1.BeginLoop_0_1_2)+gu1.BeginLoop_1_1_2)+gu1.BeginLoop_1_0_2)+gu1.BeginLoop_2_0_2)+gu1.BeginLoop_2_1_2)>=1)")
[2020-05-21 01:01:12] [INFO ] Computing symmetric co enabling matrix : 126 transitions.
[2020-05-21 01:01:12] [INFO ] Computation of co-enabling matrix(0/126) took 260 ms. Total solver calls (SAT/UNSAT): 41(0/41)
66 unique states visited
34 strongly connected components in search stack
68 transitions explored
66 items max in DFS search stack
289 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,5.19642,135276,1,0,522,518828,280,234,3465,598224,1098
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-2-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(F(X(X((G("((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_1_2)<=(((((((((((((((((gu1.BeginLoop_0_0_0+gu1.BeginLoop_2_0_0)+gu1.BeginLoop_1_0_0)+gu1.BeginLoop_1_1_0)+gu1.BeginLoop_0_1_0)+gu1.BeginLoop_1_0_1)+gu1.BeginLoop_2_0_1)+gu1.BeginLoop_2_1_0)+gu1.BeginLoop_0_0_1)+gu1.BeginLoop_2_1_1)+gu1.BeginLoop_0_0_2)+gu1.BeginLoop_0_1_1)+gu1.BeginLoop_1_1_1)+gu1.BeginLoop_0_1_2)+gu1.BeginLoop_1_1_2)+gu1.BeginLoop_1_0_2)+gu1.BeginLoop_2_0_2)+gu1.BeginLoop_2_1_2))"))||("(((gu2.CS_0+gu2.CS_1)+gu2.CS_2)<=(((((((((((gu2.TestAlone_1_0_0+gu2.TestAlone_0_0_1)+gu2.TestAlone_2_1_0)+gu2.TestAlone_1_1_0)+gu2.TestAlone_2_0_0)+gu2.TestAlone_0_0_2)+gu2.TestAlone_2_1_1)+gu2.TestAlone_0_1_1)+gu2.TestAlone_2_0_1)+gu2.TestAlone_1_1_2)+gu2.TestAlone_0_1_2)+gu2.TestAlone_1_0_2))"))))))))
Formula 3 simplified : !FGFXX("(((gu2.CS_0+gu2.CS_1)+gu2.CS_2)<=(((((((((((gu2.TestAlone_1_0_0+gu2.TestAlone_0_0_1)+gu2.TestAlone_2_1_0)+gu2.TestAlone_1_1_0)+gu2.TestAlone_2_0_0)+gu2.TestAlone_0_0_2)+gu2.TestAlone_2_1_1)+gu2.TestAlone_0_1_1)+gu2.TestAlone_2_0_1)+gu2.TestAlone_1_1_2)+gu2.TestAlone_0_1_2)+gu2.TestAlone_1_0_2))" | G"((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_1_2)<=(((((((((((((((((gu1.BeginLoop_0_0_0+gu1.BeginLoop_2_0_0)+gu1.BeginLoop_1_0_0)+gu1.BeginLoop_1_1_0)+gu1.BeginLoop_0_1_0)+gu1.BeginLoop_1_0_1)+gu1.BeginLoop_2_0_1)+gu1.BeginLoop_2_1_0)+gu1.BeginLoop_0_0_1)+gu1.BeginLoop_2_1_1)+gu1.BeginLoop_0_0_2)+gu1.BeginLoop_0_1_1)+gu1.BeginLoop_1_1_1)+gu1.BeginLoop_0_1_2)+gu1.BeginLoop_1_1_2)+gu1.BeginLoop_1_0_2)+gu1.BeginLoop_2_0_2)+gu1.BeginLoop_2_1_2))")
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29 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,5.49548,146140,1,0,589,560197,299,249,3945,642813,1262
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Peterson-PT-2-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(G(("(gu1.BeginLoop_1_1_1<=gu2.CS_2)")U(G("(gu1.BeginLoop_1_1_1<=gu2.CS_2)")))))))
Formula 4 simplified : !XXG("(gu1.BeginLoop_1_1_1<=gu2.CS_2)" U G"(gu1.BeginLoop_1_1_1<=gu2.CS_2)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
107 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,6.56271,175340,1,0,733,678975,307,310,3950,819319,1586
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-PT-2-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(X(G(X(X(F("(gu1.BeginLoop_1_0_1<=gu0.IsEndLoop_2_0_0)")))))))||(X("(gu0.EndTurn_0_1<=gu0.WantSection_0_F)"))))
Formula 5 simplified : !(!XGXXF"(gu1.BeginLoop_1_0_1<=gu0.IsEndLoop_2_0_0)" | X"(gu0.EndTurn_0_1<=gu0.WantSection_0_F)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.56378,175600,1,0,733,678975,310,310,3953,819321,1588
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Peterson-PT-2-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G(X(!(X("(gu3.WantSection_2_F<=gu3.TestIdentity_2_0_1)")))))U(G("(gu0.IsEndLoop_2_0_2<=gu0.TestIdentity_1_1_2)")))))
Formula 6 simplified : !X(GX!X"(gu3.WantSection_2_F<=gu3.TestIdentity_2_0_1)" U G"(gu0.IsEndLoop_2_0_2<=gu0.TestIdentity_1_1_2)")
[2020-05-21 01:01:16] [INFO ] Computation of co-enabling matrix(15/126) took 3720 ms. Total solver calls (SAT/UNSAT): 624(4/620)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
123 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,7.78777,198984,1,0,858,772324,316,373,3958,970099,1924
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-PT-2-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((!(("(gu4.Idle_1>=1)")U("(gu4.Idle_1<=gu4.TestTurn_2_1)")))&&(!(G("(gu4.TestIdentity_2_1_2<=gu4.Idle_0)"))))&&(!(X("(gu2.TestIdentity_0_0_2>=1)")))))
Formula 7 simplified : !(!("(gu4.Idle_1>=1)" U "(gu4.Idle_1<=gu4.TestTurn_2_1)") & !G"(gu4.TestIdentity_2_1_2<=gu4.Idle_0)" & !X"(gu2.TestIdentity_0_0_2>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
22 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,8.01173,205124,1,0,957,798176,331,407,3971,1.0047e+06,2111
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Peterson-PT-2-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("(gu1.BeginLoop_1_0_2>=1)"))U(X("(gu5.WantSection_2_T>=1)"))))
Formula 8 simplified : !(G"(gu1.BeginLoop_1_0_2>=1)" U X"(gu5.WantSection_2_T>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 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,8.06574,206664,1,0,959,801419,338,407,3973,1.01094e+06,2122
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-PT-2-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F(X(F("(gu2.Turn_0_1<=gu2.TestAlone_1_1_0)"))))))
Formula 9 simplified : FXF"(gu2.Turn_0_1<=gu2.TestAlone_1_1_0)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 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,8.08224,206928,1,0,959,802281,344,407,3976,1.01292e+06,2129
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-PT-2-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!(("(gu5.AskForSection_1_0>gu5.WantSection_1_F)")U(G(F(G(X("(gu5.AskForSection_1_1<=gu5.TestIdentity_0_1_1)")))))))))
Formula 10 simplified : !X!("(gu5.AskForSection_1_0>gu5.WantSection_1_F)" U GFGX"(gu5.AskForSection_1_1<=gu5.TestIdentity_0_1_1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
11 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,8.19045,209828,1,0,1023,816323,353,408,3980,1.02556e+06,2297
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-PT-2-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 01:01:18] [INFO ] Built C files in 10568ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590022878661

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258000705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;