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-162038396700077.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.2K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 79K 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-10b-00
FORMULA_NAME DES-PT-10b-01
FORMULA_NAME DES-PT-10b-02
FORMULA_NAME DES-PT-10b-03
FORMULA_NAME DES-PT-10b-04
FORMULA_NAME DES-PT-10b-05
FORMULA_NAME DES-PT-10b-06
FORMULA_NAME DES-PT-10b-07
FORMULA_NAME DES-PT-10b-08
FORMULA_NAME DES-PT-10b-09
FORMULA_NAME DES-PT-10b-10
FORMULA_NAME DES-PT-10b-11
FORMULA_NAME DES-PT-10b-12
FORMULA_NAME DES-PT-10b-13
FORMULA_NAME DES-PT-10b-14
FORMULA_NAME DES-PT-10b-15

=== Now, execution of the tool begins

BK_START 1620468438233

Running Version 0
[2021-05-08 10:07:19] [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:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:07:19] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-08 10:07:19] [INFO ] Transformed 320 places.
[2021-05-08 10:07:19] [INFO ] Transformed 271 transitions.
[2021-05-08 10:07:19] [INFO ] Found NUPN structural information;
[2021-05-08 10:07:19] [INFO ] Parsed PT model containing 320 places and 271 transitions in 101 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:07:19] [INFO ] Initial state test concluded for 2 properties.
FORMULA DES-PT-10b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 293 transition count 247
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 293 transition count 247
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 279 transition count 233
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 279 transition count 233
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 279 transition count 223
Applied a total of 89 rules in 68 ms. Remains 279 /320 variables (removed 41) and now considering 223/271 (removed 48) transitions.
// Phase 1: matrix 223 rows 279 cols
[2021-05-08 10:07:20] [INFO ] Computed 62 place invariants in 28 ms
[2021-05-08 10:07:20] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 223 rows 279 cols
[2021-05-08 10:07:20] [INFO ] Computed 62 place invariants in 21 ms
[2021-05-08 10:07:20] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
// Phase 1: matrix 223 rows 279 cols
[2021-05-08 10:07:20] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 10:07:20] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 279/320 places, 223/271 transitions.
[2021-05-08 10:07:20] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 10:07:20] [INFO ] Flatten gal took : 50 ms
FORMULA DES-PT-10b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:07:20] [INFO ] Flatten gal took : 21 ms
[2021-05-08 10:07:21] [INFO ] Input system was already deterministic with 223 transitions.
Incomplete random walk after 100000 steps, including 865 resets, run finished after 410 ms. (steps per millisecond=243 ) properties (out of 27) seen :17
Running SMT prover for 10 properties.
// Phase 1: matrix 223 rows 279 cols
[2021-05-08 10:07:21] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 10:07:21] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:21] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 2 ms returned unsat
[2021-05-08 10:07:21] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 10:07:21] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-08 10:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:21] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-08 10:07:21] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 3 ms to minimize.
[2021-05-08 10:07:21] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2021-05-08 10:07:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2021-05-08 10:07:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:21] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-08 10:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:21] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-08 10:07:22] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2021-05-08 10:07:22] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 2 ms to minimize.
[2021-05-08 10:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2021-05-08 10:07:22] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-08 10:07:22] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2021-05-08 10:07:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-08 10:07:22] [INFO ] Added : 204 causal constraints over 41 iterations in 778 ms. Result :sat
[2021-05-08 10:07:22] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-08 10:07:22] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-08 10:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:22] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-08 10:07:23] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2021-05-08 10:07:23] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2021-05-08 10:07:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2021-05-08 10:07:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:23] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-08 10:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:23] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-08 10:07:23] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2021-05-08 10:07:23] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2021-05-08 10:07:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2021-05-08 10:07:23] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 13 ms.
[2021-05-08 10:07:23] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2021-05-08 10:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-08 10:07:23] [INFO ] Added : 204 causal constraints over 41 iterations in 670 ms. Result :sat
[2021-05-08 10:07:24] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:24] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-08 10:07:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:24] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-08 10:07:24] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 16 ms.
[2021-05-08 10:07:24] [INFO ] Added : 121 causal constraints over 25 iterations in 414 ms. Result :unsat
[2021-05-08 10:07:24] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:24] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-08 10:07:24] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2021-05-08 10:07:24] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2021-05-08 10:07:24] [INFO ] Deduced a trap composed of 20 places in 14 ms of which 0 ms to minimize.
[2021-05-08 10:07:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 92 ms
[2021-05-08 10:07:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:25] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-08 10:07:25] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2021-05-08 10:07:25] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 0 ms to minimize.
[2021-05-08 10:07:25] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-08 10:07:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2021-05-08 10:07:25] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-08 10:07:25] [INFO ] Added : 199 causal constraints over 40 iterations in 710 ms. Result :sat
[2021-05-08 10:07:25] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 10:07:25] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:26] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-08 10:07:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2021-05-08 10:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 10:07:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:26] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-08 10:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:26] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-08 10:07:26] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 0 ms to minimize.
[2021-05-08 10:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-08 10:07:26] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-08 10:07:26] [INFO ] Added : 192 causal constraints over 39 iterations in 580 ms. Result :sat
[2021-05-08 10:07:26] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 10:07:26] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:26] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-08 10:07:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:27] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2021-05-08 10:07:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:27] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-08 10:07:27] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2021-05-08 10:07:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-08 10:07:27] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 12 ms.
[2021-05-08 10:07:27] [INFO ] Added : 185 causal constraints over 37 iterations in 619 ms. Result :sat
[2021-05-08 10:07:27] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:27] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:27] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-08 10:07:27] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2021-05-08 10:07:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2021-05-08 10:07:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:27] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-08 10:07:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:28] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-08 10:07:28] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2021-05-08 10:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2021-05-08 10:07:28] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 11 ms.
[2021-05-08 10:07:28] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2021-05-08 10:07:28] [INFO ] Deduced a trap composed of 10 places in 10 ms of which 0 ms to minimize.
[2021-05-08 10:07:28] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 0 ms to minimize.
[2021-05-08 10:07:28] [INFO ] Deduced a trap composed of 15 places in 9 ms of which 1 ms to minimize.
[2021-05-08 10:07:28] [INFO ] Deduced a trap composed of 12 places in 11 ms of which 0 ms to minimize.
[2021-05-08 10:07:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 150 ms
[2021-05-08 10:07:28] [INFO ] Added : 203 causal constraints over 41 iterations in 799 ms. Result :sat
[2021-05-08 10:07:29] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:07:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-08 10:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:29] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-08 10:07:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 10:07:29] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-08 10:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:29] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-08 10:07:29] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 12 ms.
[2021-05-08 10:07:29] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2021-05-08 10:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-08 10:07:29] [INFO ] Added : 208 causal constraints over 43 iterations in 716 ms. Result :sat
[2021-05-08 10:07:29] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:07:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-08 10:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:30] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-08 10:07:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:07:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 10:07:30] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-08 10:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:07:30] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-08 10:07:30] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2021-05-08 10:07:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-08 10:07:30] [INFO ] Computed and/alt/rep : 217/403/217 causal constraints (skipped 5 transitions) in 13 ms.
[2021-05-08 10:07:30] [INFO ] Added : 120 causal constraints over 25 iterations in 391 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 24 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:30] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 10:07:30] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:30] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:07:31] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 356 ms to find 1 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:07:31] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:07:31] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Starting structural reductions, iteration 1 : 273/279 places, 214/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:07:31] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:07:31] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 2 iterations. Remains : 273/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DES-PT-10b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s61 1), p1:(AND (EQ s46 1) (EQ s62 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 2 steps with 0 reset in 2 ms.
FORMULA DES-PT-10b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-00 finished in 955 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 278 transition count 207
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 263 transition count 207
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 263 transition count 196
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 252 transition count 196
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 249 transition count 193
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 249 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 249 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 249 transition count 189
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 247 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 246 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 246 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 246 transition count 187
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 221 place count 169 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 168 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 167 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 166 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 165 transition count 108
Applied a total of 226 rules in 76 ms. Remains 165 /279 variables (removed 114) and now considering 108/223 (removed 115) transitions.
// Phase 1: matrix 108 rows 165 cols
[2021-05-08 10:07:31] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:07:31] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 108 rows 165 cols
[2021-05-08 10:07:31] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:07:31] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 265 ms to find 1 implicit places.
[2021-05-08 10:07:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 108 rows 164 cols
[2021-05-08 10:07:32] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:07:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 164/279 places, 108/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2021-05-08 10:07:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 164 cols
[2021-05-08 10:07:32] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:07:32] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 2 iterations. Remains : 164/279 places, 108/223 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s142 1), p1:(EQ s50 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 28 steps with 1 reset in 1 ms.
FORMULA DES-PT-10b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-01 finished in 556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||((p1&&F((X(X(F(p3)))&&p2))) U p4)))], workingDir=/home/mcc/execution]
Support contains 7 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 15 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:32] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:07:32] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:32] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:07:32] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:32] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:07:32] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 274/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p4)), true, (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p4), (AND (NOT p3) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (NOT p3)]
Running random walk in product with property : DES-PT-10b-02 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p4) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p4) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p4) p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p4) p1 p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p4) p1 p2), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p4) p1 (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p4) p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p4) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p4) p1 p2), acceptance={0} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 8}, { cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s16 1) (EQ s27 1) (EQ s38 1)), p4:(EQ s58 1), p1:(EQ s181 0), p2:(AND (EQ s5 1) (EQ s16 1) (EQ s27 1) (EQ s38 1)), p3:(EQ s173 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-02 finished in 756 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 278 transition count 206
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 262 transition count 205
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 262 transition count 194
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 251 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 249 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 249 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 249 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 249 transition count 188
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 247 transition count 188
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 221 place count 169 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 167 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 166 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 165 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 164 transition count 113
Applied a total of 228 rules in 49 ms. Remains 164 /279 variables (removed 115) and now considering 113/223 (removed 110) transitions.
// Phase 1: matrix 113 rows 164 cols
[2021-05-08 10:07:33] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:07:33] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 113 rows 164 cols
[2021-05-08 10:07:33] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:07:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 237 ms to find 1 implicit places.
[2021-05-08 10:07:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 113 rows 163 cols
[2021-05-08 10:07:33] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:07:33] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, iteration 1 : 163/279 places, 113/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2021-05-08 10:07:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 113 rows 163 cols
[2021-05-08 10:07:33] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:07:33] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 163/279 places, 113/223 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-03 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:(EQ s46 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 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-03 finished in 493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 12 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:33] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:07:33] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:07:33] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:07:33] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 321 ms to find 1 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:07:33] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:07:33] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 273/279 places, 214/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:07:33] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:07:34] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 2 iterations. Remains : 273/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-10b-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s3 1), p0:(EQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-05 finished in 667 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 278 transition count 206
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 262 transition count 205
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 262 transition count 194
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 251 transition count 194
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 248 transition count 191
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 248 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 248 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 63 place count 248 transition count 187
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 246 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 245 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 245 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 245 transition count 185
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 222 place count 169 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 167 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 166 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 165 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 164 transition count 109
Applied a total of 229 rules in 41 ms. Remains 164 /279 variables (removed 115) and now considering 109/223 (removed 114) transitions.
// Phase 1: matrix 109 rows 164 cols
[2021-05-08 10:07:34] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:07:34] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 109 rows 164 cols
[2021-05-08 10:07:34] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:07:34] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 244 ms to find 1 implicit places.
[2021-05-08 10:07:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 109 rows 163 cols
[2021-05-08 10:07:34] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:07:34] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Starting structural reductions, iteration 1 : 163/279 places, 109/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2021-05-08 10:07:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 109 rows 163 cols
[2021-05-08 10:07:34] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:07:34] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 163/279 places, 109/223 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4913 reset in 305 ms.
Product exploration explored 100000 steps with 4913 reset in 303 ms.
Graph (complete) has 501 edges and 163 vertex of which 160 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4888 reset in 238 ms.
Product exploration explored 100000 steps with 4855 reset in 353 ms.
[2021-05-08 10:07:35] [INFO ] Flatten gal took : 14 ms
[2021-05-08 10:07:35] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:07:35] [INFO ] Time to serialize gal into /tmp/LTL18010921711454211356.gal : 5 ms
[2021-05-08 10:07:35] [INFO ] Time to serialize properties into /tmp/LTL13147067485060574656.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/LTL18010921711454211356.gal, -t, CGAL, -LTL, /tmp/LTL13147067485060574656.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/LTL18010921711454211356.gal -t CGAL -LTL /tmp/LTL13147067485060574656.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p197!=1)"))))
Formula 0 simplified : !FG"(p197!=1)"
Detected timeout of ITS tools.
[2021-05-08 10:07:50] [INFO ] Flatten gal took : 19 ms
[2021-05-08 10:07:50] [INFO ] Applying decomposition
[2021-05-08 10:07:50] [INFO ] Flatten gal took : 9 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/graph2029088426931688848.txt, -o, /tmp/graph2029088426931688848.bin, -w, /tmp/graph2029088426931688848.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/graph2029088426931688848.bin, -l, -1, -v, -w, /tmp/graph2029088426931688848.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:07:51] [INFO ] Decomposing Gal with order
[2021-05-08 10:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:07:51] [INFO ] Removed a total of 42 redundant transitions.
[2021-05-08 10:07:51] [INFO ] Flatten gal took : 36 ms
[2021-05-08 10:07:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2021-05-08 10:07:51] [INFO ] Time to serialize gal into /tmp/LTL12517374994999910632.gal : 4 ms
[2021-05-08 10:07:51] [INFO ] Time to serialize properties into /tmp/LTL16385708094493829471.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/LTL12517374994999910632.gal, -t, CGAL, -LTL, /tmp/LTL16385708094493829471.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/LTL12517374994999910632.gal -t CGAL -LTL /tmp/LTL16385708094493829471.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i7.i0.u14.p197!=1)"))))
Formula 0 simplified : !FG"(i7.i0.u14.p197!=1)"
Reverse transition relation is NOT exact ! Due to transitions t0, t216_t79, t7_t48_t39, t9_t34, t10_t34, t184_t34, t183_t25, t106_t107_t122_t222_t130_t131_t127_t128_t116_t117, u43.t11.t17, u43.t145.t15.t16, i0.u2.t159, i0.u2.t160, i0.u2.t161, i0.u2.t162, i0.u2.t163, i0.u2.t164, i2.t193, i3.t215, i3.u6.t1.t96.t89, i3.u6.t2.t91.t92.t101.t221, i4.u0.t176.t131.t99.t100.t101.t221, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/79/21/100
Computing Next relation with stutter on 6.47736e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7330135574782363709
[2021-05-08 10:08:06] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7330135574782363709
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/ltsmin7330135574782363709]
Compilation finished in 644 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7330135574782363709]
Link finished in 50 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin7330135574782363709]
LTSmin run took 362 ms.
FORMULA DES-PT-10b-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-07 finished in 33132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 10 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:08:07] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:08:07] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:08:07] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:08:07] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 339 ms to find 1 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:08:07] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:08:07] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 273/279 places, 214/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:08:07] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:08:07] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 2 iterations. Remains : 273/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-10b-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s54 1) (NEQ s58 1) (NEQ s68 1) (NEQ s69 1) (NEQ s73 1) (NEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Graph (complete) has 527 edges and 273 vertex of which 268 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0), true]
Support contains 6 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 273 transition count 214
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 15 place count 273 transition count 225
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 273 transition count 225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 268 transition count 220
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 268 transition count 220
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 106 place count 268 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 116 place count 258 transition count 214
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 126 place count 258 transition count 214
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 131 place count 258 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 256 transition count 228
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 256 transition count 228
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 135 rules in 52 ms. Remains 256 /273 variables (removed 17) and now considering 228/214 (removed -14) transitions.
[2021-05-08 10:08:09] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 228 rows 256 cols
[2021-05-08 10:08:09] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:08:09] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 256/273 places, 228/214 transitions.
Product exploration explored 100000 steps with 50000 reset in 1108 ms.
Product exploration explored 100000 steps with 50000 reset in 1031 ms.
[2021-05-08 10:08:11] [INFO ] Flatten gal took : 10 ms
[2021-05-08 10:08:11] [INFO ] Flatten gal took : 10 ms
[2021-05-08 10:08:11] [INFO ] Time to serialize gal into /tmp/LTL4320708236745601827.gal : 2 ms
[2021-05-08 10:08:11] [INFO ] Time to serialize properties into /tmp/LTL354552406307624590.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/LTL4320708236745601827.gal, -t, CGAL, -LTL, /tmp/LTL354552406307624590.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/LTL4320708236745601827.gal -t CGAL -LTL /tmp/LTL354552406307624590.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((((((p56!=1)||(p63!=1))||(p85!=1))||(p87!=1))||(p95!=1))||(p106!=1))")))
Formula 0 simplified : !X"((((((p56!=1)||(p63!=1))||(p85!=1))||(p87!=1))||(p95!=1))||(p106!=1))"
Detected timeout of ITS tools.
[2021-05-08 10:08:26] [INFO ] Flatten gal took : 10 ms
[2021-05-08 10:08:26] [INFO ] Applying decomposition
[2021-05-08 10:08:26] [INFO ] Flatten gal took : 11 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/graph8954921865435408466.txt, -o, /tmp/graph8954921865435408466.bin, -w, /tmp/graph8954921865435408466.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/graph8954921865435408466.bin, -l, -1, -v, -w, /tmp/graph8954921865435408466.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:08:26] [INFO ] Decomposing Gal with order
[2021-05-08 10:08:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:08:26] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-08 10:08:26] [INFO ] Flatten gal took : 22 ms
[2021-05-08 10:08:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-08 10:08:26] [INFO ] Time to serialize gal into /tmp/LTL10769931811671399584.gal : 4 ms
[2021-05-08 10:08:26] [INFO ] Time to serialize properties into /tmp/LTL16264704413619079316.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/LTL10769931811671399584.gal, -t, CGAL, -LTL, /tmp/LTL16264704413619079316.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/LTL10769931811671399584.gal -t CGAL -LTL /tmp/LTL16264704413619079316.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X("((((((i4.u6.p56!=1)||(i4.u7.p63!=1))||(i3.u8.p85!=1))||(i4.u11.p87!=1))||(i2.i1.u13.p95!=1))||(i2.i1.u15.p106!=1))")))
Formula 0 simplified : !X"((((((i4.u6.p56!=1)||(i4.u7.p63!=1))||(i3.u8.p85!=1))||(i4.u11.p87!=1))||(i2.i1.u13.p95!=1))||(i2.i1.u15.p106!=1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t164, t183, t184, t216, u31.t76, i0.u29.t79, i2.i1.u13.t111, i3.t117, i3.u8.t159, i3.u8.t160, i3.u8.t161, i3.u8.t162, i3.u8.t163, i4.t123, i4.u6.t130, i4.u6.t131, i4.u7.t127, i4.u7.t128, i4.u11.t114, i5.t100, i5.t88, i5.i0.t214, i5.i0.u17.t104, i5.i0.u20.t92, i5.i0.u20.t221, i5.i0.u23.t1, i5.i0.u23.t96, i5.i1.u21.t98, i6.u26.t87, i7.i0.u34.t74, i8.i0.u37.t72, i8.i1.t54, i8.i1.t56, i8.i1.u51.t57, i8.i1.u52.t55, i8.i2.u50.t59, i9.i0.t50, i9.i0.u53.t53, i9.i0.u54.t51, i9.i1.u55.t48, i10.t60, i10.i0.u49.t61, i10.i1.t62, i10.i1.u47.t64, i10.i1.u48.t63, i11.t193, i11.t10, i11.t9, i11.u63.t37, i11.u64.t34, i11.u71.t25, i12.u74.t17, i12.u74.t145, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/156/56/212
Computing Next relation with stutter on 6.47736e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
999 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,10.0205,221752,1,0,357283,9629,3093,1.0684e+06,1270,35711,498649
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-10b-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-10b-08 finished in 30707 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 15 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:08:37] [INFO ] Computed 62 place invariants in 1 ms
[2021-05-08 10:08:38] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:08:38] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:08:38] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:08:38] [INFO ] Computed 61 place invariants in 15 ms
[2021-05-08 10:08:38] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Starting structural reductions, iteration 1 : 273/279 places, 214/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:08:38] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:08:38] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 2 iterations. Remains : 273/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Graph (complete) has 527 edges and 273 vertex of which 268 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 273 transition count 214
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 14 place count 273 transition count 225
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 273 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 269 transition count 221
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 269 transition count 221
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 110 place count 269 transition count 224
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 121 place count 258 transition count 213
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 132 place count 258 transition count 213
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 258 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 256 transition count 235
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 256 transition count 235
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 142 rules in 28 ms. Remains 256 /273 variables (removed 17) and now considering 235/214 (removed -21) transitions.
[2021-05-08 10:08:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 235 rows 256 cols
[2021-05-08 10:08:39] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:08:40] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 256/273 places, 235/214 transitions.
Product exploration explored 100000 steps with 50000 reset in 1159 ms.
Product exploration explored 100000 steps with 50000 reset in 1090 ms.
[2021-05-08 10:08:42] [INFO ] Flatten gal took : 9 ms
[2021-05-08 10:08:42] [INFO ] Flatten gal took : 9 ms
[2021-05-08 10:08:42] [INFO ] Time to serialize gal into /tmp/LTL6006403938574859938.gal : 1 ms
[2021-05-08 10:08:42] [INFO ] Time to serialize properties into /tmp/LTL12989476512128525713.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/LTL6006403938574859938.gal, -t, CGAL, -LTL, /tmp/LTL12989476512128525713.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/LTL6006403938574859938.gal -t CGAL -LTL /tmp/LTL12989476512128525713.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p129!=1)"))))
Formula 0 simplified : !XF"(p129!=1)"
Detected timeout of ITS tools.
[2021-05-08 10:08:57] [INFO ] Flatten gal took : 27 ms
[2021-05-08 10:08:57] [INFO ] Applying decomposition
[2021-05-08 10:08:57] [INFO ] Flatten gal took : 24 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/graph2233810864747374272.txt, -o, /tmp/graph2233810864747374272.bin, -w, /tmp/graph2233810864747374272.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/graph2233810864747374272.bin, -l, -1, -v, -w, /tmp/graph2233810864747374272.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:08:57] [INFO ] Decomposing Gal with order
[2021-05-08 10:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:08:57] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-08 10:08:57] [INFO ] Flatten gal took : 71 ms
[2021-05-08 10:08:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-08 10:08:57] [INFO ] Time to serialize gal into /tmp/LTL6782335007459627034.gal : 31 ms
[2021-05-08 10:08:57] [INFO ] Time to serialize properties into /tmp/LTL7585685377344132235.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/LTL6782335007459627034.gal, -t, CGAL, -LTL, /tmp/LTL7585685377344132235.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/LTL6782335007459627034.gal -t CGAL -LTL /tmp/LTL7585685377344132235.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i3.u26.p129!=1)"))))
Formula 0 simplified : !XF"(i3.u26.p129!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2647279088164665016
[2021-05-08 10:09:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2647279088164665016
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/ltsmin2647279088164665016]
Compilation finished in 956 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2647279088164665016]
Link finished in 86 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, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2647279088164665016]
LTSmin run took 223 ms.
FORMULA DES-PT-10b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-09 finished in 36060 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0))&&G((F(p0)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 9 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:09:14] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:09:14] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:09:14] [INFO ] Computed 62 place invariants in 1 ms
[2021-05-08 10:09:14] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 330 ms to find 1 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:09:14] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:09:14] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 273/279 places, 214/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:09:14] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:09:14] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 2 iterations. Remains : 273/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DES-PT-10b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s43 1) (EQ s62 1)), p0:(AND (EQ s233 1) (EQ s251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-10 finished in 708 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 278 transition count 207
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 263 transition count 206
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 263 transition count 195
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 252 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 249 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 249 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 249 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 249 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 247 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 246 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 246 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 246 transition count 186
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 222 place count 169 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 167 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 166 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 165 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 164 transition count 109
Applied a total of 229 rules in 29 ms. Remains 164 /279 variables (removed 115) and now considering 109/223 (removed 114) transitions.
// Phase 1: matrix 109 rows 164 cols
[2021-05-08 10:09:14] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:09:14] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 109 rows 164 cols
[2021-05-08 10:09:14] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:09:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 10:09:14] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
[2021-05-08 10:09:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 163 cols
[2021-05-08 10:09:14] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:09:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 163/279 places, 109/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2021-05-08 10:09:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 109 rows 163 cols
[2021-05-08 10:09:15] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:09:15] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 163/279 places, 109/223 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-12 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 276 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 276 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 276 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 275 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 275 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 275 transition count 216
Applied a total of 11 rules in 7 ms. Remains 275 /279 variables (removed 4) and now considering 216/223 (removed 7) transitions.
// Phase 1: matrix 216 rows 275 cols
[2021-05-08 10:09:15] [INFO ] Computed 62 place invariants in 1 ms
[2021-05-08 10:09:15] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 216 rows 275 cols
[2021-05-08 10:09:15] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:09:15] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
// Phase 1: matrix 216 rows 274 cols
[2021-05-08 10:09:15] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:09:15] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 274/279 places, 216/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2021-05-08 10:09:15] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:09:15] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 2 iterations. Remains : 274/279 places, 216/223 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s167 1) (NEQ s197 1) (NEQ s76 1) (NEQ s256 1)), p1:(AND (EQ s6 1) (EQ s130 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-13 finished in 644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0)||(p0&&F(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 274 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 274 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 274 transition count 214
Applied a total of 14 rules in 7 ms. Remains 274 /279 variables (removed 5) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:09:15] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:09:15] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 214 rows 274 cols
[2021-05-08 10:09:15] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:09:16] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 315 ms to find 1 implicit places.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:09:16] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:09:16] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 273/279 places, 214/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 273 cols
[2021-05-08 10:09:16] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:09:16] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 2 iterations. Remains : 273/279 places, 214/223 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s183 1), p1:(AND (NEQ s16 0) (NEQ s265 0) (NEQ s183 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1461 steps with 11 reset in 3 ms.
FORMULA DES-PT-10b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-14 finished in 704 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 275 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 275 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 275 transition count 216
Applied a total of 11 rules in 5 ms. Remains 275 /279 variables (removed 4) and now considering 216/223 (removed 7) transitions.
// Phase 1: matrix 216 rows 275 cols
[2021-05-08 10:09:16] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:09:16] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 216 rows 275 cols
[2021-05-08 10:09:16] [INFO ] Computed 62 place invariants in 1 ms
[2021-05-08 10:09:16] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 335 ms to find 1 implicit places.
// Phase 1: matrix 216 rows 274 cols
[2021-05-08 10:09:16] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 10:09:16] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 274/279 places, 216/223 transitions.
Applied a total of 0 rules in 2 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2021-05-08 10:09:16] [INFO ] Computed 61 place invariants in 1 ms
[2021-05-08 10:09:17] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 2 iterations. Remains : 274/279 places, 216/223 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-10b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s60 1) (EQ s111 1)), p1:(AND (NEQ s97 0) (NEQ s1 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-15 finished in 692 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620468559553

--------------------
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-10b"
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-10b, 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-162038396700077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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