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.r083-tall-162048875300405.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 DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K 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.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 33K 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 DoubleExponent-PT-002-00
FORMULA_NAME DoubleExponent-PT-002-01
FORMULA_NAME DoubleExponent-PT-002-02
FORMULA_NAME DoubleExponent-PT-002-03
FORMULA_NAME DoubleExponent-PT-002-04
FORMULA_NAME DoubleExponent-PT-002-05
FORMULA_NAME DoubleExponent-PT-002-06
FORMULA_NAME DoubleExponent-PT-002-07
FORMULA_NAME DoubleExponent-PT-002-08
FORMULA_NAME DoubleExponent-PT-002-09
FORMULA_NAME DoubleExponent-PT-002-10
FORMULA_NAME DoubleExponent-PT-002-11
FORMULA_NAME DoubleExponent-PT-002-12
FORMULA_NAME DoubleExponent-PT-002-13
FORMULA_NAME DoubleExponent-PT-002-14
FORMULA_NAME DoubleExponent-PT-002-15

=== Now, execution of the tool begins

BK_START 1620583368131

Running Version 0
[2021-05-09 18:02:52] [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-09 18:02:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:02:52] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-09 18:02:52] [INFO ] Transformed 110 places.
[2021-05-09 18:02:52] [INFO ] Transformed 98 transitions.
[2021-05-09 18:02:52] [INFO ] Parsed PT model containing 110 places and 98 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 18:02:52] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-002-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 14 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2021-05-09 18:02:52] [INFO ] Computed 11 place invariants in 22 ms
[2021-05-09 18:02:52] [INFO ] Implicit Places using invariants in 162 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:52] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-09 18:02:52] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 105/110 places, 98/98 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:52] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:02:53] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 2 iterations. Remains : 105/110 places, 98/98 transitions.
[2021-05-09 18:02:53] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 18:02:53] [INFO ] Flatten gal took : 32 ms
FORMULA DoubleExponent-PT-002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 18:02:53] [INFO ] Flatten gal took : 12 ms
[2021-05-09 18:02:53] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 100000 steps, including 3302 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 22) seen :18
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:53] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-09 18:02:53] [INFO ] Computed and/alt/rep : 97/185/97 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:02:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-09 18:02:53] [INFO ] Computed and/alt/rep : 97/185/97 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:02:54] [INFO ] Added : 94 causal constraints over 19 iterations in 195 ms. Result :sat
[2021-05-09 18:02:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:02:54] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-09 18:02:54] [INFO ] Computed and/alt/rep : 97/185/97 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:02:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:54] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:54] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-09 18:02:54] [INFO ] Computed and/alt/rep : 97/185/97 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:02:54] [INFO ] Added : 91 causal constraints over 19 iterations in 163 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2021-05-09 18:02:54] [INFO ] Initial state test concluded for 1 properties.
FORMULA DoubleExponent-PT-002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:54] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:02:54] [INFO ] Implicit Places using invariants in 48 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
// Phase 1: matrix 98 rows 104 cols
[2021-05-09 18:02:54] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-09 18:02:54] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Starting structural reductions, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 9 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:54] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:54] [INFO ] Computed 9 place invariants in 10 ms
[2021-05-09 18:02:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s11 1) (GEQ s55 1)), p1:(AND (GEQ s11 1) (GEQ s55 1) (OR (LT s37 1) (LT s57 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-00 finished in 502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 104 transition count 79
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 86 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 84 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 84 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 79 transition count 72
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 84 place count 62 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 88 place count 60 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 59 transition count 54
Applied a total of 89 rules in 22 ms. Remains 59 /105 variables (removed 46) and now considering 54/98 (removed 44) transitions.
// Phase 1: matrix 54 rows 59 cols
[2021-05-09 18:02:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants in 34 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
[2021-05-09 18:02:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 58 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 58/105 places, 54/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 56 transition count 52
Applied a total of 4 rules in 5 ms. Remains 56 /58 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 56 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 56/105 places, 52/98 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-02 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 (LT s48 1) (LT s11 1) (OR (LT s31 1) (LT s38 1)) (OR (LT s2 1) (LT s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-02 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)||F(G((p2 U p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 81 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 46 place count 81 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 77 transition count 70
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 94 place count 57 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 98 place count 55 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 54 transition count 49
Applied a total of 99 rules in 14 ms. Remains 54 /105 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 54 cols
[2021-05-09 18:02:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants in 29 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
[2021-05-09 18:02:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 49 rows 53 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 9 ms
[2021-05-09 18:02:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 53/105 places, 49/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 52 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 51 transition count 47
Applied a total of 4 rules in 4 ms. Remains 51 /53 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 51/105 places, 47/98 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s12 1), p0:(GEQ s16 1), p2:(GEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-002-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-03 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants in 37 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
// Phase 1: matrix 98 rows 104 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:55] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 18:02:55] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ 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:(GEQ s95 1), p1:(LT s29 1)], 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]]
Product exploration explored 100000 steps with 3831 reset in 245 ms.
Product exploration explored 100000 steps with 3841 reset in 148 ms.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3865 reset in 106 ms.
Product exploration explored 100000 steps with 3835 reset in 131 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 103/103 places, 97/97 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 103 transition count 97
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 103 transition count 100
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 103 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 99 transition count 96
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 99 transition count 96
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 98 transition count 99
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 98 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 98 transition count 117
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 93 transition count 107
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 93 transition count 107
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 73 rules in 14 ms. Remains 93 /103 variables (removed 10) and now considering 107/97 (removed -10) transitions.
[2021-05-09 18:02:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 93 cols
[2021-05-09 18:02:57] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:57] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/103 places, 107/97 transitions.
Product exploration explored 100000 steps with 10601 reset in 574 ms.
Product exploration explored 100000 steps with 10563 reset in 248 ms.
[2021-05-09 18:02:58] [INFO ] Flatten gal took : 8 ms
[2021-05-09 18:02:58] [INFO ] Flatten gal took : 6 ms
[2021-05-09 18:02:58] [INFO ] Time to serialize gal into /tmp/LTL3209508660834903791.gal : 6 ms
[2021-05-09 18:02:58] [INFO ] Time to serialize properties into /tmp/LTL14859408334302206013.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/LTL3209508660834903791.gal, -t, CGAL, -LTL, /tmp/LTL14859408334302206013.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/LTL3209508660834903791.gal -t CGAL -LTL /tmp/LTL14859408334302206013.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p92>=1)")||(G(F("(p29<1)")))))))
Formula 0 simplified : !XX("(p92>=1)" | GF"(p29<1)")
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t58, t63, t66, t69, t70, t75, t76, t82, t83, t86, t88, t93, t96, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/22/97
Computing Next relation with stutter on 396 deadlock states
952 unique states visited
0 strongly connected components in search stack
1723 transitions explored
886 items max in DFS search stack
323 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,3.26505,123124,1,0,2053,399537,230,2797,3123,599393,7740
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-002-07 finished in 8056 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 74
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 81 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 80 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 50 place count 80 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 77 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 94 place count 58 transition count 51
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 3 with 2 rules applied. Total rules applied 96 place count 57 transition count 51
Applied a total of 96 rules in 10 ms. Remains 57 /105 variables (removed 48) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 57 cols
[2021-05-09 18:03:03] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:03:03] [INFO ] Implicit Places using invariants in 112 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
[2021-05-09 18:03:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 56 cols
[2021-05-09 18:03:03] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:03] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 56/105 places, 51/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 54 transition count 49
Applied a total of 4 rules in 4 ms. Remains 54 /56 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 54 cols
[2021-05-09 18:03:03] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 49 rows 54 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 54/105 places, 49/98 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s37 1)), p1:(AND (GEQ s16 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 51 steps with 7 reset in 0 ms.
FORMULA DoubleExponent-PT-002-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-10 finished in 569 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:03:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants in 50 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
// Phase 1: matrix 98 rows 104 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-11 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s18 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-11 finished in 336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1||X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:03:04] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants in 37 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
// Phase 1: matrix 98 rows 104 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 18:03:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:03:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:04] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-002-13 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s50 1) (GEQ s57 1)) (AND (GEQ s22 1) (GEQ s38 1))), p2:(AND (GEQ s22 1) (GEQ s38 1)), p1:(AND (GEQ s50 1) (GEQ s57 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-13 finished in 331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0)))&&F(((p2&&X(p3))||G(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 0 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:03:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:03:05] [INFO ] Implicit Places using invariants in 33 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 98 rows 104 cols
[2021-05-09 18:03:05] [INFO ] Computed 9 place invariants in 17 ms
[2021-05-09 18:03:05] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:03:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:05] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:03:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p3)]
Running random walk in product with property : DoubleExponent-PT-002-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND p2 p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s97 1) (OR (LT s1 1) (LT s102 1))), p0:(OR (LT s1 1) (LT s102 1)), p2:(LT s97 1), p3:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-14 finished in 412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 104 transition count 74
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 81 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 80 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 48 place count 80 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 56 place count 76 transition count 69
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 90 place count 59 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 94 place count 57 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 56 transition count 51
Applied a total of 95 rules in 11 ms. Remains 56 /105 variables (removed 49) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 56 cols
[2021-05-09 18:03:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:03:05] [INFO ] Implicit Places using invariants in 28 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
[2021-05-09 18:03:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 55 cols
[2021-05-09 18:03:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 18:03:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 55/105 places, 51/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 53 transition count 49
Applied a total of 4 rules in 4 ms. Remains 53 /55 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 53 cols
[2021-05-09 18:03:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:03:05] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 49 rows 53 cols
[2021-05-09 18:03:05] [INFO ] Computed 9 place invariants in 12 ms
[2021-05-09 18:03:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 18:03:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 53/105 places, 49/98 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 : DoubleExponent-PT-002-15 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:(LT s40 1), p1:(OR (GEQ s11 1) (LT s35 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 8115 reset in 118 ms.
Product exploration explored 100000 steps with 8095 reset in 152 ms.
Graph (complete) has 144 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8049 reset in 106 ms.
Product exploration explored 100000 steps with 8161 reset in 111 ms.
[2021-05-09 18:03:06] [INFO ] Flatten gal took : 4 ms
[2021-05-09 18:03:06] [INFO ] Flatten gal took : 4 ms
[2021-05-09 18:03:06] [INFO ] Time to serialize gal into /tmp/LTL17934230194221827754.gal : 1 ms
[2021-05-09 18:03:06] [INFO ] Time to serialize properties into /tmp/LTL13659672200069919466.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/LTL17934230194221827754.gal, -t, CGAL, -LTL, /tmp/LTL13659672200069919466.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/LTL17934230194221827754.gal -t CGAL -LTL /tmp/LTL13659672200069919466.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p67<1)")||(F("((p20>=1)||(p6<1))"))))))
Formula 0 simplified : !FG("(p67<1)" | F"((p20>=1)||(p6<1))")
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12.t43, t45.t46, t77.t88, t84.t58, t85.t86, t93, t96, t55.t66, t51.t52.t59.t63, t61.t62.t53, t68.t70, t71.t54.t56.t72.t76, t81.t83, t90.t91.t92.t13.t17, t5.t6.t13.t17, t8.t9.t26.t30, t94.t95.t26.t30, t74.t75.t57, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/29/20/49
Computing Next relation with stutter on 396 deadlock states
359 unique states visited
0 strongly connected components in search stack
359 transitions explored
359 items max in DFS search stack
57 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.579133,37928,1,0,825,90222,126,1117,1823,129079,2977
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DoubleExponent-PT-002-15 finished in 1508 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620583387873

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r083-tall-162048875300405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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