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-162038397700772.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 Dekker-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397700772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 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 247K 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 Dekker-PT-020-00
FORMULA_NAME Dekker-PT-020-01
FORMULA_NAME Dekker-PT-020-02
FORMULA_NAME Dekker-PT-020-03
FORMULA_NAME Dekker-PT-020-04
FORMULA_NAME Dekker-PT-020-05
FORMULA_NAME Dekker-PT-020-06
FORMULA_NAME Dekker-PT-020-07
FORMULA_NAME Dekker-PT-020-08
FORMULA_NAME Dekker-PT-020-09
FORMULA_NAME Dekker-PT-020-10
FORMULA_NAME Dekker-PT-020-11
FORMULA_NAME Dekker-PT-020-12
FORMULA_NAME Dekker-PT-020-13
FORMULA_NAME Dekker-PT-020-14
FORMULA_NAME Dekker-PT-020-15

=== Now, execution of the tool begins

BK_START 1620569620175

Running Version 0
[2021-05-09 14:13:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-09 14:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:13:41] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-09 14:13:41] [INFO ] Transformed 100 places.
[2021-05-09 14:13:41] [INFO ] Transformed 440 transitions.
[2021-05-09 14:13:41] [INFO ] Found NUPN structural information;
[2021-05-09 14:13:41] [INFO ] Parsed PT model containing 100 places and 440 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-020-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 2038 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:43] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2021-05-09 14:13:43] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-09 14:13:44] [INFO ] Implicit Places using invariants in 224 ms returned [43, 52, 55, 58, 61, 64, 70, 73, 79, 82, 85, 88, 91, 94, 97]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 250 ms to find 15 implicit places.
[2021-05-09 14:13:44] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:44] [INFO ] Computed 45 place invariants in 8 ms
[2021-05-09 14:13:44] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Starting structural reductions, iteration 1 : 85/100 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:44] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:44] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:13:44] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 2 iterations. Remains : 85/100 places, 440/440 transitions.
[2021-05-09 14:13:44] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 14:13:44] [INFO ] Flatten gal took : 73 ms
FORMULA Dekker-PT-020-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:13:44] [INFO ] Flatten gal took : 38 ms
[2021-05-09 14:13:44] [INFO ] Input system was already deterministic with 440 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 689 ms. (steps per millisecond=145 ) properties (out of 20) seen :13
Running SMT prover for 7 properties.
[2021-05-09 14:13:45] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:45] [INFO ] Computed 45 place invariants in 5 ms
[2021-05-09 14:13:45] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:45] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-09 14:13:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:45] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-09 14:13:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:13:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:45] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 324 ms
[2021-05-09 14:13:46] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2021-05-09 14:13:46] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2021-05-09 14:13:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 311 ms
[2021-05-09 14:13:46] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2021-05-09 14:13:46] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 5 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 220 ms
[2021-05-09 14:13:46] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2021-05-09 14:13:46] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:46] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 6 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 566 ms
[2021-05-09 14:13:47] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 10 ms.
[2021-05-09 14:13:47] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
[2021-05-09 14:13:47] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 14:13:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:47] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:13:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:47] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 331 ms
[2021-05-09 14:13:48] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2021-05-09 14:13:48] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
[2021-05-09 14:13:48] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:48] [INFO ] [Real]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:13:48] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:13:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:13:48] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 14:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:13:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:13:48] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 9 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:13:48] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 346 ms
[2021-05-09 14:13:48] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 10 ms.
[2021-05-09 14:13:48] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-09 14:13:48] [INFO ] Initial state test concluded for 1 properties.
FORMULA Dekker-PT-020-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 39 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:48] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:48] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-09 14:13:48] [INFO ] Implicit Places using invariants in 96 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 98 ms to find 5 implicit places.
[2021-05-09 14:13:48] [INFO ] Redundant transitions in 26 ms returned []
[2021-05-09 14:13:48] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:13:48] [INFO ] Computed 40 place invariants in 6 ms
[2021-05-09 14:13:48] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 28 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:48] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-09 14:13:48] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:13:48] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:13:49] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-020-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s42 0) (NEQ s76 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 0 reset in 563 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 1 ms.
FORMULA Dekker-PT-020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-00 finished in 1232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||F((G(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 15 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:49] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:49] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:13:49] [INFO ] Implicit Places using invariants in 83 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 84 ms to find 5 implicit places.
[2021-05-09 14:13:49] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:13:49] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:13:49] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:13:50] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 15 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:50] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:13:50] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:13:50] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:13:50] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-020-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 p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s61 1)), p1:(OR (EQ s27 0) (EQ s29 1)), p2:(OR (EQ s23 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1525 reset in 476 ms.
Stack based approach found an accepted trace after 449 steps with 4 reset with depth 61 and stack size 57 in 3 ms.
FORMULA Dekker-PT-020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-01 finished in 984 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:50] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:50] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:13:50] [INFO ] Implicit Places using invariants in 84 ms returned [40, 45, 48, 61]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
[2021-05-09 14:13:50] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:13:50] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:13:51] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Starting structural reductions, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:51] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:13:51] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:13:51] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : Dekker-PT-020-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s51 0) (EQ s64 1)), p1:(OR (EQ s48 0) (EQ s24 1)), p2:(AND (EQ s24 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 506 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA Dekker-PT-020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-02 finished in 5675 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:56] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-09 14:13:56] [INFO ] Implicit Places using invariants in 86 ms returned [40, 45, 48, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
[2021-05-09 14:13:56] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:13:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:13:56] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:13:56] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:56] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:13:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:13:56] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:13:56] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-020-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s58 0) (NEQ s12 1)), p0:(EQ s60 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 425 ms.
Product exploration explored 100000 steps with 0 reset in 495 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 424 ms.
Product exploration explored 100000 steps with 0 reset in 503 ms.
[2021-05-09 14:13:59] [INFO ] Flatten gal took : 34 ms
[2021-05-09 14:13:59] [INFO ] Flatten gal took : 30 ms
[2021-05-09 14:13:59] [INFO ] Time to serialize gal into /tmp/LTL965103555639271599.gal : 9 ms
[2021-05-09 14:13:59] [INFO ] Time to serialize properties into /tmp/LTL1537090544482336310.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/LTL965103555639271599.gal, -t, CGAL, -LTL, /tmp/LTL1537090544482336310.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/LTL965103555639271599.gal -t CGAL -LTL /tmp/LTL1537090544482336310.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p3_9==0)")||(G("((p0_9==1)||(flag_0_6==0))"))))))
Formula 0 simplified : !GF("(p3_9==0)" | G"((p0_9==1)||(flag_0_6==0))")
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t373, t395, t417, t439, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
31 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,0.364273,27368,1,0,914,72256,920,446,7096,43522,915
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-020-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Dekker-PT-020-03 finished in 2960 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:13:59] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:13:59] [INFO ] Implicit Places using invariants in 90 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 91 ms to find 5 implicit places.
[2021-05-09 14:13:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:13:59] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:13:59] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:13:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:13:59] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:13:59] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 853 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s67 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 33382 reset in 332 ms.
Stack based approach found an accepted trace after 51 steps with 22 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Dekker-PT-020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-04 finished in 1591 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:14:01] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:14:01] [INFO ] Implicit Places using invariants in 85 ms returned [40, 45, 61, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
[2021-05-09 14:14:01] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:01] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-09 14:14:01] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Starting structural reductions, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:01] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:01] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:14:01] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : Dekker-PT-020-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s46 0) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-05 finished in 455 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:14:01] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-09 14:14:01] [INFO ] Implicit Places using invariants in 88 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 89 ms to find 5 implicit places.
[2021-05-09 14:14:01] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:01] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:01] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:01] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:01] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:01] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-020-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s54 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]]
Product exploration explored 100000 steps with 4733 reset in 428 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Dekker-PT-020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-08 finished in 881 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:02] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:14:02] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-09 14:14:02] [INFO ] Implicit Places using invariants in 84 ms returned [45, 48, 61, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
[2021-05-09 14:14:02] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:02] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:14:02] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 81/85 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:02] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:02] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-09 14:14:02] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-020-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s73 0) (EQ s18 1)), p0:(OR (EQ s27 0) (EQ s40 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:11] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:11] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:11] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:14:11] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 440/440 transitions.
Product exploration explored 100000 steps with 50000 reset in 1075 ms.
Product exploration explored 100000 steps with 50000 reset in 1033 ms.
[2021-05-09 14:14:13] [INFO ] Flatten gal took : 27 ms
[2021-05-09 14:14:13] [INFO ] Flatten gal took : 25 ms
[2021-05-09 14:14:13] [INFO ] Time to serialize gal into /tmp/LTL5651723765659363093.gal : 4 ms
[2021-05-09 14:14:13] [INFO ] Time to serialize properties into /tmp/LTL1178128857631209866.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/LTL5651723765659363093.gal, -t, CGAL, -LTL, /tmp/LTL1178128857631209866.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/LTL5651723765659363093.gal -t CGAL -LTL /tmp/LTL1178128857631209866.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((flag_1_13==0)||(p0_0==1))")||(F("((p1_16==0)||(flag_0_9==1))")))))
Formula 0 simplified : !X("((flag_1_13==0)||(p0_0==1))" | F"((p1_16==0)||(flag_0_9==1))")
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t373, t395, t417, t439, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
28 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,0.329459,26700,1,0,910,67097,904,443,6963,39651,891
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Dekker-PT-020-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-020-09 finished in 11671 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:14:14] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:14:14] [INFO ] Implicit Places using invariants in 95 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 96 ms to find 5 implicit places.
[2021-05-09 14:14:14] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:14] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:14] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:14] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:14] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:14] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-020-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 0) (EQ s57 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]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Dekker-PT-020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-10 finished in 869 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:14:14] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-09 14:14:15] [INFO ] Implicit Places using invariants in 109 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 109 ms to find 5 implicit places.
[2021-05-09 14:14:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:15] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:15] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:15] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:15] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 1312 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 496 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 416 ms.
Product exploration explored 100000 steps with 0 reset in 486 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 2888 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:21] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:21] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:21] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Product exploration explored 100000 steps with 0 reset in 488 ms.
Product exploration explored 100000 steps with 0 reset in 502 ms.
[2021-05-09 14:14:22] [INFO ] Flatten gal took : 24 ms
[2021-05-09 14:14:22] [INFO ] Flatten gal took : 22 ms
[2021-05-09 14:14:22] [INFO ] Time to serialize gal into /tmp/LTL2069577198867242316.gal : 3 ms
[2021-05-09 14:14:22] [INFO ] Time to serialize properties into /tmp/LTL4250544458483032824.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2069577198867242316.gal, -t, CGAL, -LTL, /tmp/LTL4250544458483032824.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/LTL2069577198867242316.gal -t CGAL -LTL /tmp/LTL4250544458483032824.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("(p3_17==0)"))))
Formula 0 simplified : !XG"(p3_17==0)"
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t373, t395, t417, t439, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
58 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,0.635908,37188,1,0,952,140244,909,463,7045,80662,1011
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-020-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-020-11 finished in 8483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(F((p1&&X(F(p1)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 85 cols
[2021-05-09 14:14:23] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-09 14:14:23] [INFO ] Implicit Places using invariants in 86 ms returned [40, 45, 48, 61, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 87 ms to find 5 implicit places.
[2021-05-09 14:14:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:23] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:23] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Starting structural reductions, iteration 1 : 80/85 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:23] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:23] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/85 places, 440/440 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-020-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s78 1)), p1:(OR (EQ s47 0) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 442 ms.
Product exploration explored 100000 steps with 0 reset in 538 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 444 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:26] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:26] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:26] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:26] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 0 reset in 494 ms.
[2021-05-09 14:14:27] [INFO ] Flatten gal took : 19 ms
[2021-05-09 14:14:27] [INFO ] Flatten gal took : 19 ms
[2021-05-09 14:14:27] [INFO ] Time to serialize gal into /tmp/LTL17699790584636721568.gal : 3 ms
[2021-05-09 14:14:27] [INFO ] Time to serialize properties into /tmp/LTL1502124459411433357.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17699790584636721568.gal, -t, CGAL, -LTL, /tmp/LTL1502124459411433357.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/LTL17699790584636721568.gal -t CGAL -LTL /tmp/LTL1502124459411433357.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("((p3_3==0)||(p1_19==1))")||(X(F(("((p3_3==0)||(p1_19==1))")&&(X(F("((p3_3==0)||(p1_19==1))")))))))))
Formula 0 simplified : !G("((p3_3==0)||(p1_19==1))" | XF("((p3_3==0)||(p1_19==1))" & XF"((p3_3==0)||(p1_19==1))"))
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t373, t395, t417, t439, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.348693,27708,1,0,914,71722,907,445,7043,44113,912
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-020-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-020-15 finished in 8537 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620569673973

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Dekker-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 Dekker-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r064-tall-162038397700772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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