Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038396700085.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20a-00
FORMULA_NAME DES-PT-20a-01
FORMULA_NAME DES-PT-20a-02
FORMULA_NAME DES-PT-20a-03
FORMULA_NAME DES-PT-20a-04
FORMULA_NAME DES-PT-20a-05
FORMULA_NAME DES-PT-20a-06
FORMULA_NAME DES-PT-20a-07
FORMULA_NAME DES-PT-20a-08
FORMULA_NAME DES-PT-20a-09
FORMULA_NAME DES-PT-20a-10
FORMULA_NAME DES-PT-20a-11
FORMULA_NAME DES-PT-20a-12
FORMULA_NAME DES-PT-20a-13
FORMULA_NAME DES-PT-20a-14
FORMULA_NAME DES-PT-20a-15

=== Now, execution of the tool begins

BK_START 1620469032190

Running Version 0
[2021-05-08 10:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 10:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:17:22] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-08 10:17:22] [INFO ] Transformed 195 places.
[2021-05-08 10:17:22] [INFO ] Transformed 152 transitions.
[2021-05-08 10:17:22] [INFO ] Found NUPN structural information;
[2021-05-08 10:17:22] [INFO ] Parsed PT model containing 195 places and 152 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:17:22] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 66 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 20 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:17:22] [INFO ] Computed 59 place invariants in 27 ms
[2021-05-08 10:17:22] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:17:22] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-08 10:17:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:17:22] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:17:22] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-08 10:17:23] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 138/138 transitions.
[2021-05-08 10:17:23] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-08 10:17:23] [INFO ] Flatten gal took : 48 ms
FORMULA DES-PT-20a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:17:23] [INFO ] Flatten gal took : 23 ms
[2021-05-08 10:17:23] [INFO ] Input system was already deterministic with 138 transitions.
Incomplete random walk after 100000 steps, including 2224 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 28) seen :15
Running SMT prover for 13 properties.
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:17:23] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-08 10:17:23] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:23] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-08 10:17:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:24] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-08 10:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:17:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:17:24] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 11 ms.
[2021-05-08 10:17:24] [INFO ] Added : 101 causal constraints over 21 iterations in 341 ms. Result :sat
[2021-05-08 10:17:24] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:24] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-08 10:17:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:24] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-08 10:17:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:17:25] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:17:25] [INFO ] Added : 74 causal constraints over 15 iterations in 251 ms. Result :sat
[2021-05-08 10:17:25] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2021-05-08 10:17:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 10:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:25] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-08 10:17:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2021-05-08 10:17:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2021-05-08 10:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:25] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-08 10:17:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-08 10:17:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 4 ms to minimize.
[2021-05-08 10:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-08 10:17:25] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 12 ms.
[2021-05-08 10:17:26] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2021-05-08 10:17:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2021-05-08 10:17:26] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2021-05-08 10:17:26] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2021-05-08 10:17:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 314 ms
[2021-05-08 10:17:26] [INFO ] Added : 85 causal constraints over 18 iterations in 684 ms. Result :sat
[2021-05-08 10:17:26] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:26] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2021-05-08 10:17:26] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:26] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-08 10:17:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:26] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-08 10:17:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-08 10:17:26] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 15 ms.
[2021-05-08 10:17:27] [INFO ] Added : 93 causal constraints over 19 iterations in 382 ms. Result :sat
[2021-05-08 10:17:27] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:27] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-08 10:17:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:27] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-08 10:17:27] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:17:27] [INFO ] Added : 74 causal constraints over 16 iterations in 252 ms. Result :sat
[2021-05-08 10:17:27] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:27] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-08 10:17:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:28] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 10:17:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2021-05-08 10:17:28] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2021-05-08 10:17:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2021-05-08 10:17:28] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 13 ms.
[2021-05-08 10:17:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2021-05-08 10:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-08 10:17:28] [INFO ] Added : 59 causal constraints over 12 iterations in 220 ms. Result :sat
[2021-05-08 10:17:28] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:28] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-08 10:17:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 55 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:28] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-08 10:17:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:17:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2021-05-08 10:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-08 10:17:28] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:17:29] [INFO ] Added : 92 causal constraints over 19 iterations in 259 ms. Result :sat
[2021-05-08 10:17:29] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:29] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 10:17:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:17:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 101 ms returned sat
[2021-05-08 10:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:29] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-08 10:17:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-08 10:17:29] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 9 ms.
[2021-05-08 10:17:30] [INFO ] Added : 69 causal constraints over 14 iterations in 330 ms. Result :sat
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-08 10:17:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:30] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:17:30] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 11 ms.
[2021-05-08 10:17:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2021-05-08 10:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-08 10:17:30] [INFO ] Added : 71 causal constraints over 15 iterations in 303 ms. Result :sat
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:30] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-08 10:17:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:31] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-08 10:17:31] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2021-05-08 10:17:31] [INFO ] Added : 69 causal constraints over 14 iterations in 372 ms. Result :sat
[2021-05-08 10:17:31] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:31] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-08 10:17:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:17:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 71 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:17:31] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-08 10:17:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-08 10:17:32] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2021-05-08 10:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-08 10:17:32] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 14 ms.
[2021-05-08 10:17:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2021-05-08 10:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-08 10:17:32] [INFO ] Added : 87 causal constraints over 18 iterations in 276 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2021-05-08 10:17:32] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-20a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||X(X(F((G(p2)&&p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 31 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:17:36] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 10:17:36] [INFO ] Implicit Places using invariants in 117 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:36] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 10:17:36] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:36] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 10:17:37] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-20a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s75 1) (EQ s85 1)), p1:(AND (EQ s111 1) (EQ s174 1)), p2:(AND (EQ s24 1) (EQ s188 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA DES-PT-20a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-00 finished in 988 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 73 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:17:37] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-08 10:17:37] [INFO ] Implicit Places using invariants in 269 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 271 ms to find 1 implicit places.
[2021-05-08 10:17:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:37] [INFO ] Computed 58 place invariants in 9 ms
[2021-05-08 10:17:37] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-08 10:17:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:37] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:17:37] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s109 1) (EQ s77 1) (EQ s85 1)), p0:(AND (EQ s45 1) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-01 finished in 685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 8 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:17:38] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 10:17:38] [INFO ] Implicit Places using invariants in 138 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:38] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:17:38] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:38] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:17:38] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s101 1) (EQ s106 1) (EQ s108 1)), p0:(OR (EQ s28 0) (EQ s188 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3057 reset in 322 ms.
Product exploration explored 100000 steps with 3033 reset in 290 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3044 reset in 224 ms.
Product exploration explored 100000 steps with 3054 reset in 368 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 193 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-08 10:17:40] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:17:40] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-08 10:17:40] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 137/137 transitions.
Product exploration explored 100000 steps with 3050 reset in 369 ms.
Product exploration explored 100000 steps with 3062 reset in 345 ms.
[2021-05-08 10:17:41] [INFO ] Flatten gal took : 14 ms
[2021-05-08 10:17:41] [INFO ] Flatten gal took : 14 ms
[2021-05-08 10:17:41] [INFO ] Time to serialize gal into /tmp/LTL4519181141990448277.gal : 12 ms
[2021-05-08 10:17:41] [INFO ] Time to serialize properties into /tmp/LTL15254839552258271724.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4519181141990448277.gal, -t, CGAL, -LTL, /tmp/LTL15254839552258271724.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4519181141990448277.gal -t CGAL -LTL /tmp/LTL15254839552258271724.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p28==0)||(p190==0))"))||(X(X(F("(((p102==1)&&(p107==1))&&(p109==1))"))))))
Formula 0 simplified : !(G"((p28==0)||(p190==0))" | XXF"(((p102==1)&&(p107==1))&&(p109==1))")
Detected timeout of ITS tools.
[2021-05-08 10:17:56] [INFO ] Flatten gal took : 21 ms
[2021-05-08 10:17:56] [INFO ] Applying decomposition
[2021-05-08 10:17:56] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18999763799026988.txt, -o, /tmp/graph18999763799026988.bin, -w, /tmp/graph18999763799026988.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18999763799026988.bin, -l, -1, -v, -w, /tmp/graph18999763799026988.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:17:56] [INFO ] Decomposing Gal with order
[2021-05-08 10:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:17:56] [INFO ] Removed a total of 31 redundant transitions.
[2021-05-08 10:17:56] [INFO ] Flatten gal took : 45 ms
[2021-05-08 10:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 5 ms.
[2021-05-08 10:17:56] [INFO ] Time to serialize gal into /tmp/LTL12835824368066550433.gal : 5 ms
[2021-05-08 10:17:56] [INFO ] Time to serialize properties into /tmp/LTL11312980511243325499.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12835824368066550433.gal, -t, CGAL, -LTL, /tmp/LTL11312980511243325499.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12835824368066550433.gal -t CGAL -LTL /tmp/LTL11312980511243325499.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((u49.p28==0)||(u49.p190==0))"))||(X(X(F("(((i1.i0.u8.p102==1)&&(i1.i1.u11.p107==1))&&(i0.u12.p109==1))"))))))
Formula 0 simplified : !(G"((u49.p28==0)||(u49.p190==0))" | XXF"(((i1.i0.u8.p102==1)&&(i1.i1.u11.p107==1))&&(i0.u12.p109==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t131, u13.t90, u49.t5, u49.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2.t56, i0.u2.t57, i0.u2.t58, i0.u2.t59, i0.u2.t60, i0.u2.t61, i0.u2.t62, i0.u2.t63, i0.u2.t64, i0.u2.t65, i0.u2.t66, i0.u2.t67, i0.u2.t68, i0.u2.t69, i0.u2.t70, i1.i0.t0, i1.i0.t129, i1.i0.t135, i1.i0.u1.t9, i1.i1.u0.t10, i1.i1.u6.t136, i3.t12, i12.t108, i12.t4, i12.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/86/35/121
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11030504966568798601
[2021-05-08 10:18:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11030504966568798601
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11030504966568798601]
Compilation finished in 762 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11030504966568798601]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11030504966568798601]
LTSmin run took 1299 ms.
FORMULA DES-PT-20a-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20a-02 finished in 35461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((G(F(p1)) U p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 10:18:13] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-08 10:18:13] [INFO ] Implicit Places using invariants in 178 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
[2021-05-08 10:18:13] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 138 rows 194 cols
[2021-05-08 10:18:13] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:18:13] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Starting structural reductions, iteration 1 : 194/195 places, 138/138 transitions.
Applied a total of 0 rules in 6 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2021-05-08 10:18:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 194 cols
[2021-05-08 10:18:13] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:13] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 138/138 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-20a-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(NOT p2), acceptance={} source=8 dest: 2}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s117 1) (EQ s186 1)), p2:(AND (EQ s82 1) (EQ s94 1)), p1:(AND (EQ s44 1) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-03 finished in 764 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 5 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:14] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-08 10:18:14] [INFO ] Implicit Places using invariants in 92 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:14] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:14] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:14] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:14] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DES-PT-20a-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (NEQ s9 0) (NEQ s112 0) (NEQ s114 0)), p0:(AND (EQ s55 1) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-04 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 192 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 192 transition count 136
Applied a total of 3 rules in 12 ms. Remains 192 /195 variables (removed 3) and now considering 136/138 (removed 2) transitions.
// Phase 1: matrix 136 rows 192 cols
[2021-05-08 10:18:14] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:14] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 136 rows 192 cols
[2021-05-08 10:18:14] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:14] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2021-05-08 10:18:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 192 cols
[2021-05-08 10:18:14] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 192/195 places, 136/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-20a-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-05 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p0)||X(p1))) U p2))], workingDir=/home/mcc/execution]
Support contains 8 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 5 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:15] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 10:18:15] [INFO ] Implicit Places using invariants in 97 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:15] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:15] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : DES-PT-20a-08 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s96 0) (EQ s14 1) (EQ s112 1) (EQ s114 1)), p0:(AND (EQ s96 1) (EQ s15 1) (EQ s112 1) (EQ s114 1)), p1:(AND (EQ s92 1) (EQ s102 1) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-08 finished in 438 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((!p0&&F(G(((p2||F(p0))&&p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 7 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:15] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 10:18:15] [INFO ] Implicit Places using invariants in 95 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:15] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:15] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-20a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s78 1) (EQ s85 1)), p1:(AND (EQ s145 1) (EQ s161 1)), p2:(AND (EQ s145 1) (EQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-10 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 5 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:15] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 10:18:16] [INFO ] Implicit Places using invariants in 92 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:16] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:18:16] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:16] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-08 10:18:16] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s169 1) (EQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-11 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 4 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:16] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-08 10:18:16] [INFO ] Implicit Places using invariants in 97 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:16] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-08 10:18:16] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:16] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:16] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s86 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-13 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||F(p1)||X(F((p0 U (p2||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 11 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 3 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:16] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-08 10:18:16] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:16] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-08 10:18:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:18:16] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:16] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 10:18:17] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 194/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 85 ms :[false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-20a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s81 1) (NEQ s83 1) (NEQ s87 1) (NEQ s88 1) (NEQ s90 1) (NEQ s92 1)), p1:(AND (EQ s102 1) (EQ s107 1) (EQ s109 1)), p2:(AND (OR (NEQ s81 1) (NEQ s83 1) (NEQ s87 1) (NEQ s88 1) (NEQ s90 1) (NEQ s92 1)) (OR (NEQ s91 1) (NEQ s185 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17868 reset in 282 ms.
Product exploration explored 100000 steps with 17752 reset in 351 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 75 ms :[false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 17720 reset in 302 ms.
Product exploration explored 100000 steps with 17888 reset in 322 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 96 ms :[false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 11 out of 194 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 194/194 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 194 /194 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-08 10:18:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:18] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-08 10:18:18] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 137/137 transitions.
Product exploration explored 100000 steps with 17908 reset in 547 ms.
Product exploration explored 100000 steps with 17970 reset in 567 ms.
[2021-05-08 10:18:19] [INFO ] Flatten gal took : 12 ms
[2021-05-08 10:18:19] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:18:19] [INFO ] Time to serialize gal into /tmp/LTL11736876193787714510.gal : 1 ms
[2021-05-08 10:18:19] [INFO ] Time to serialize properties into /tmp/LTL14688184979009801929.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11736876193787714510.gal, -t, CGAL, -LTL, /tmp/LTL14688184979009801929.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11736876193787714510.gal -t CGAL -LTL /tmp/LTL14688184979009801929.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("(((p102==1)&&(p107==1))&&(p109==1))"))||(X(F(("((((((p81!=1)||(p83!=1))||(p87!=1))||(p88!=1))||(p90!=1))||(p92!=1))")U(("(((((((p81!=1)||(p83!=1))||(p87!=1))||(p88!=1))||(p90!=1))||(p92!=1))&&((p91!=1)||(p185!=1)))")||(G("((((((p81!=1)||(p83!=1))||(p87!=1))||(p88!=1))||(p90!=1))||(p92!=1))")))))))||("((((((p81==1)&&(p83==1))&&(p87==1))&&(p88==1))&&(p90==1))&&(p92==1))"))))
Formula 0 simplified : !X("((((((p81==1)&&(p83==1))&&(p87==1))&&(p88==1))&&(p90==1))&&(p92==1))" | F"(((p102==1)&&(p107==1))&&(p109==1))" | XF("((((((p81!=1)||(p83!=1))||(p87!=1))||(p88!=1))||(p90!=1))||(p92!=1))" U ("(((((((p81!=1)||(p83!=1))||(p87!=1))||(p88!=1))||(p90!=1))||(p92!=1))&&((p91!=1)||(p185!=1)))" | G"((((((p81!=1)||(p83!=1))||(p87!=1))||(p88!=1))||(p90!=1))||(p92!=1))")))
Detected timeout of ITS tools.
[2021-05-08 10:18:35] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:18:35] [INFO ] Applying decomposition
[2021-05-08 10:18:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9822116218726034833.txt, -o, /tmp/graph9822116218726034833.bin, -w, /tmp/graph9822116218726034833.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9822116218726034833.bin, -l, -1, -v, -w, /tmp/graph9822116218726034833.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:18:35] [INFO ] Decomposing Gal with order
[2021-05-08 10:18:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:18:35] [INFO ] Removed a total of 16 redundant transitions.
[2021-05-08 10:18:35] [INFO ] Flatten gal took : 16 ms
[2021-05-08 10:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-08 10:18:35] [INFO ] Time to serialize gal into /tmp/LTL4763453672363911375.gal : 2 ms
[2021-05-08 10:18:35] [INFO ] Time to serialize properties into /tmp/LTL9164651539887885600.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4763453672363911375.gal, -t, CGAL, -LTL, /tmp/LTL9164651539887885600.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4763453672363911375.gal -t CGAL -LTL /tmp/LTL9164651539887885600.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F("(((i1.i0.u8.p102==1)&&(i1.i1.u11.p107==1))&&(i0.u12.p109==1))"))||(X(F(("((((((i1.i1.u0.p81!=1)||(i1.i0.u1.p83!=1))||(i0.u2.p87!=1))||(i12.i0.u3.p88!=1))||(i12.i1.u4.p90!=1))||(i12.i1.u4.p92!=1))")U(("(((((((i1.i1.u0.p81!=1)||(i1.i0.u1.p83!=1))||(i0.u2.p87!=1))||(i12.i0.u3.p88!=1))||(i12.i1.u4.p90!=1))||(i12.i1.u4.p92!=1))&&((i12.i1.u4.p91!=1)||(i12.i1.u47.p185!=1)))")||(G("((((((i1.i1.u0.p81!=1)||(i1.i0.u1.p83!=1))||(i0.u2.p87!=1))||(i12.i0.u3.p88!=1))||(i12.i1.u4.p90!=1))||(i12.i1.u4.p92!=1))")))))))||("((((((i1.i1.u0.p81==1)&&(i1.i0.u1.p83==1))&&(i0.u2.p87==1))&&(i12.i0.u3.p88==1))&&(i12.i1.u4.p90==1))&&(i12.i1.u4.p92==1))"))))
Formula 0 simplified : !X("((((((i1.i1.u0.p81==1)&&(i1.i0.u1.p83==1))&&(i0.u2.p87==1))&&(i12.i0.u3.p88==1))&&(i12.i1.u4.p90==1))&&(i12.i1.u4.p92==1))" | F"(((i1.i0.u8.p102==1)&&(i1.i1.u11.p107==1))&&(i0.u12.p109==1))" | XF("((((((i1.i1.u0.p81!=1)||(i1.i0.u1.p83!=1))||(i0.u2.p87!=1))||(i12.i0.u3.p88!=1))||(i12.i1.u4.p90!=1))||(i12.i1.u4.p92!=1))" U ("(((((((i1.i1.u0.p81!=1)||(i1.i0.u1.p83!=1))||(i0.u2.p87!=1))||(i12.i0.u3.p88!=1))||(i12.i1.u4.p90!=1))||(i12.i1.u4.p92!=1))&&((i12.i1.u4.p91!=1)||(i12.i1.u47.p185!=1)))" | G"((((((i1.i1.u0.p81!=1)||(i1.i0.u1.p83!=1))||(i0.u2.p87!=1))||(i12.i0.u3.p88!=1))||(i12.i1.u4.p90!=1))||(i12.i1.u4.p92!=1))")))
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t131, u13.t90, u14.t11, u48.t5, u48.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2.t56, i0.u2.t57, i0.u2.t58, i0.u2.t59, i0.u2.t60, i0.u2.t61, i0.u2.t62, i0.u2.t63, i0.u2.t64, i0.u2.t65, i0.u2.t66, i0.u2.t67, i0.u2.t68, i0.u2.t69, i0.u2.t70, i1.i0.t0, i1.i0.t129, i1.i0.t135, i1.i0.u1.t9, i1.i1.u0.t10, i1.i1.u6.t136, i12.t4, i12.t3, i12.i1.t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/102/35/137
Computing Next relation with stutter on 850244 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
933 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,9.36432,273128,1,0,671037,33497,2053,620515,2292,160666,865580
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-20a-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-20a-14 finished in 29287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 9 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2021-05-08 10:18:45] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-08 10:18:46] [INFO ] Implicit Places using invariants in 115 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
[2021-05-08 10:18:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:46] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:46] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2021-05-08 10:18:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 193 cols
[2021-05-08 10:18:46] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-08 10:18:46] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 137/138 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s113 1) (EQ s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-15 finished in 401 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620469127293

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20a"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-20a, 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 r064-tall-162038396700085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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