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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.1K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:04 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.3K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 17K 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-001-00
FORMULA_NAME DoubleExponent-PT-001-01
FORMULA_NAME DoubleExponent-PT-001-02
FORMULA_NAME DoubleExponent-PT-001-03
FORMULA_NAME DoubleExponent-PT-001-04
FORMULA_NAME DoubleExponent-PT-001-05
FORMULA_NAME DoubleExponent-PT-001-06
FORMULA_NAME DoubleExponent-PT-001-07
FORMULA_NAME DoubleExponent-PT-001-08
FORMULA_NAME DoubleExponent-PT-001-09
FORMULA_NAME DoubleExponent-PT-001-10
FORMULA_NAME DoubleExponent-PT-001-11
FORMULA_NAME DoubleExponent-PT-001-12
FORMULA_NAME DoubleExponent-PT-001-13
FORMULA_NAME DoubleExponent-PT-001-14
FORMULA_NAME DoubleExponent-PT-001-15

=== Now, execution of the tool begins

BK_START 1620583153837

Running Version 0
[2021-05-09 17:59:15] [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 17:59:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:59:15] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-09 17:59:15] [INFO ] Transformed 57 places.
[2021-05-09 17:59:15] [INFO ] Transformed 48 transitions.
[2021-05-09 17:59:15] [INFO ] Parsed PT model containing 57 places and 48 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:59:15] [INFO ] Initial state test concluded for 4 properties.
FORMULA DoubleExponent-PT-001-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 10 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:15] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-09 17:59:15] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:15] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 17:59:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:15] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 17:59:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/57 places, 48/48 transitions.
[2021-05-09 17:59:15] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 17:59:15] [INFO ] Flatten gal took : 23 ms
FORMULA DoubleExponent-PT-001-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:59:15] [INFO ] Flatten gal took : 7 ms
[2021-05-09 17:59:15] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 100000 steps, including 3304 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 21) seen :20
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:16] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 17:59:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 17:59:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-09 17:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:59:16] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 52 transition count 37
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 42 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 41 transition count 34
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 26 place count 39 transition count 34
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 29 transition count 24
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 29 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 28 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 28 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 27 transition count 22
Applied a total of 51 rules in 23 ms. Remains 27 /53 variables (removed 26) and now considering 22/48 (removed 26) transitions.
// Phase 1: matrix 22 rows 27 cols
[2021-05-09 17:59:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants in 27 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
[2021-05-09 17:59:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2021-05-09 17:59:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:16] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 25/53 places, 22/48 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 25 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 21 transition count 18
Applied a total of 8 rules in 4 ms. Remains 21 /25 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 17:59:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 17:59:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/53 places, 18/48 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-01 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((((p1||G(p0)) U p2)&&X(G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants in 22 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 48 rows 52 cols
[2021-05-09 17:59:16] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 17:59:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 52/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2021-05-09 17:59:16] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 17:59:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 52/53 places, 48/48 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p3)]
Running random walk in product with property : DoubleExponent-PT-001-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=3 dest: 5}, { cond=(OR p0 p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 2}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s14 1), p2:(GEQ s48 1), p1:(AND (GEQ s15 1) (GEQ s34 1)), p3:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-02 finished in 343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:16] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants in 22 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:59:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:16] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-001-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s11 1) (GEQ s29 1)), p1:(GEQ s29 1), p2:(OR (LT s1 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6560 reset in 218 ms.
Product exploration explored 100000 steps with 6474 reset in 147 ms.
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6339 reset in 112 ms.
Product exploration explored 100000 steps with 6388 reset in 134 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 50/50 places, 47/47 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 50 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 10 place count 50 transition count 47
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 50 transition count 47
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 46 transition count 43
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 46 transition count 43
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 45 transition count 44
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 45 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 45 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 44 transition count 45
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 44 transition count 45
Deduced a syphon composed of 17 places in 1 ms
Applied a total of 35 rules in 11 ms. Remains 44 /50 variables (removed 6) and now considering 45/47 (removed 2) transitions.
[2021-05-09 17:59:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 44 cols
[2021-05-09 17:59:17] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/50 places, 45/47 transitions.
Product exploration explored 100000 steps with 14987 reset in 244 ms.
Product exploration explored 100000 steps with 14919 reset in 176 ms.
[2021-05-09 17:59:18] [INFO ] Flatten gal took : 5 ms
[2021-05-09 17:59:18] [INFO ] Flatten gal took : 4 ms
[2021-05-09 17:59:18] [INFO ] Time to serialize gal into /tmp/LTL10343446291470294499.gal : 1 ms
[2021-05-09 17:59:18] [INFO ] Time to serialize properties into /tmp/LTL14710955610608388311.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/LTL10343446291470294499.gal, -t, CGAL, -LTL, /tmp/LTL14710955610608388311.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/LTL10343446291470294499.gal -t CGAL -LTL /tmp/LTL14710955610608388311.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((p2>=1)||(p39>=1))"))&&(X(F(("(p39>=1)")||(G("((p10<1)||(p16<1))")))))))
Formula 0 simplified : !(F"((p2>=1)||(p39>=1))" & XF("(p39>=1)" | G"((p10<1)||(p16<1))"))
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/9/47
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 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.111102,20952,1,0,350,17406,139,309,1405,22112,776
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-001-04 finished in 1756 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 52 transition count 37
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 42 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 41 transition count 34
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 26 place count 39 transition count 34
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 29 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 28 transition count 23
Applied a total of 47 rules in 8 ms. Remains 28 /53 variables (removed 25) and now considering 23/48 (removed 25) transitions.
// Phase 1: matrix 23 rows 28 cols
[2021-05-09 17:59:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:18] [INFO ] Implicit Places using invariants in 16 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-09 17:59:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 26 cols
[2021-05-09 17:59:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 26/53 places, 23/48 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 26 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 22 transition count 19
Applied a total of 8 rules in 2 ms. Remains 22 /26 variables (removed 4) and now considering 19/23 (removed 4) transitions.
// Phase 1: matrix 19 rows 22 cols
[2021-05-09 17:59:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:18] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 19 rows 22 cols
[2021-05-09 17:59:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:18] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/53 places, 19/48 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-05 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(p0)||X(F(p1)))) U ((p2&&X((G(p0)||X(F(p1)))))||X(G((G(p0)||X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:18] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 17:59:18] [INFO ] Implicit Places using invariants in 21 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:59:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:18] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 17:59:18] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(LT s32 1), p0:(OR (LT s28 1) (GEQ s32 1)), p1:(LT s28 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 76 ms.
Product exploration explored 100000 steps with 33333 reset in 116 ms.
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 50/50 places, 47/47 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 11 place count 50 transition count 47
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 50 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 47 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 47 transition count 44
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 47 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 46 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 46 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 46 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 45 transition count 47
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 45 transition count 47
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 37 rules in 9 ms. Remains 45 /50 variables (removed 5) and now considering 47/47 (removed 0) transitions.
[2021-05-09 17:59:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 47 rows 45 cols
[2021-05-09 17:59:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/50 places, 47/47 transitions.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Product exploration explored 100000 steps with 33333 reset in 175 ms.
[2021-05-09 17:59:20] [INFO ] Flatten gal took : 4 ms
[2021-05-09 17:59:20] [INFO ] Flatten gal took : 4 ms
[2021-05-09 17:59:20] [INFO ] Time to serialize gal into /tmp/LTL8722372824374049582.gal : 2 ms
[2021-05-09 17:59:20] [INFO ] Time to serialize properties into /tmp/LTL8701243670583689568.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/LTL8722372824374049582.gal, -t, CGAL, -LTL, /tmp/LTL8701243670583689568.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/LTL8722372824374049582.gal -t CGAL -LTL /tmp/LTL8701243670583689568.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X((G("((p38<1)||(p41>=1))"))||(X(F("(p38<1)")))))U((X(G((G("((p38<1)||(p41>=1))"))||(X(F("(p38<1)"))))))||(("(p41<1)")&&(X((G("((p38<1)||(p41>=1))"))||(X(F("(p38<1)")))))))))
Formula 0 simplified : !(X(G"((p38<1)||(p41>=1))" | XF"(p38<1)") U (XG(G"((p38<1)||(p41>=1))" | XF"(p38<1)") | ("(p41<1)" & X(G"((p38<1)||(p41>=1))" | XF"(p38<1)"))))
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/9/47
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
5 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.05716,20452,1,0,87,6633,128,53,1403,3720,117
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-001-08 finished in 1677 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 52 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 41 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 39 transition count 34
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 48 place count 28 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 28 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 27 transition count 22
Applied a total of 50 rules in 6 ms. Remains 27 /53 variables (removed 26) and now considering 22/48 (removed 26) transitions.
// Phase 1: matrix 22 rows 27 cols
[2021-05-09 17:59:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 17:59:20] [INFO ] Implicit Places using invariants in 20 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-09 17:59:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2021-05-09 17:59:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:20] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 25/53 places, 22/48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 21 transition count 18
Applied a total of 8 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 17:59:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 17:59:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:20] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/53 places, 18/48 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-09 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:20] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 17:59:20] [INFO ] Implicit Places using invariants in 19 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:59:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:20] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ 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:(GEQ s36 1), p1:(OR (LT s36 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3311 reset in 68 ms.
Product exploration explored 100000 steps with 3326 reset in 75 ms.
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3294 reset in 67 ms.
Product exploration explored 100000 steps with 3347 reset in 75 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 50/50 places, 47/47 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 11 place count 50 transition count 48
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 50 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 46 transition count 44
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 46 transition count 44
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 46 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 45 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 45 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 45 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 42 transition count 44
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 42 transition count 44
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 44 rules in 7 ms. Remains 42 /50 variables (removed 8) and now considering 44/47 (removed 3) transitions.
[2021-05-09 17:59:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 42 cols
[2021-05-09 17:59:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/50 places, 44/47 transitions.
Product exploration explored 100000 steps with 11528 reset in 109 ms.
Product exploration explored 100000 steps with 11541 reset in 119 ms.
[2021-05-09 17:59:21] [INFO ] Flatten gal took : 3 ms
[2021-05-09 17:59:21] [INFO ] Flatten gal took : 3 ms
[2021-05-09 17:59:21] [INFO ] Time to serialize gal into /tmp/LTL17392596623997547637.gal : 1 ms
[2021-05-09 17:59:21] [INFO ] Time to serialize properties into /tmp/LTL6198975433630114922.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/LTL17392596623997547637.gal, -t, CGAL, -LTL, /tmp/LTL6198975433630114922.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/LTL17392596623997547637.gal -t CGAL -LTL /tmp/LTL6198975433630114922.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p45>=1)")||(G(F("((p45<1)||(p53>=1))"))))))
Formula 0 simplified : !X("(p45>=1)" | GF"((p45<1)||(p53>=1))")
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/9/47
Computing Next relation with stutter on 16 deadlock states
110 unique states visited
0 strongly connected components in search stack
203 transitions explored
107 items max in DFS search stack
13 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.138118,21956,1,0,278,20488,130,348,1471,29953,972
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-001-10 finished in 1206 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2021-05-09 17:59:21] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:21] [INFO ] Implicit Places using invariants in 17 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:59:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 1 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:21] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:59:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-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: 2}]], initial=3, aps=[p0:(OR (LT s2 1) (LT s21 1) (AND (GEQ s5 1) (GEQ s48 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-11 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 52 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 41 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 39 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 27 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 26 transition count 21
Applied a total of 51 rules in 4 ms. Remains 26 /53 variables (removed 27) and now considering 21/48 (removed 27) transitions.
// Phase 1: matrix 21 rows 26 cols
[2021-05-09 17:59:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants in 23 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
[2021-05-09 17:59:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 24 cols
[2021-05-09 17:59:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 24/53 places, 21/48 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 24 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 20 transition count 17
Applied a total of 8 rules in 1 ms. Remains 20 /24 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 20 cols
[2021-05-09 17:59:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-09 17:59:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/53 places, 17/48 transitions.
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-001-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-13 finished in 117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 38
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 43 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 42 transition count 34
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 26 place count 39 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 31 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 31 transition count 26
Applied a total of 43 rules in 4 ms. Remains 31 /53 variables (removed 22) and now considering 26/48 (removed 22) transitions.
// Phase 1: matrix 26 rows 31 cols
[2021-05-09 17:59:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants in 16 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-09 17:59:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 29 cols
[2021-05-09 17:59:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 29/53 places, 26/48 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 29 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 25 transition count 22
Applied a total of 8 rules in 2 ms. Remains 25 /29 variables (removed 4) and now considering 22/26 (removed 4) transitions.
// Phase 1: matrix 22 rows 25 cols
[2021-05-09 17:59:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2021-05-09 17:59:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/53 places, 22/48 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s14 1) (AND (GEQ s0 1) (GEQ s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12634 reset in 90 ms.
Product exploration explored 100000 steps with 12583 reset in 84 ms.
Graph (complete) has 62 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12508 reset in 75 ms.
Product exploration explored 100000 steps with 12590 reset in 85 ms.
[2021-05-09 17:59:22] [INFO ] Flatten gal took : 2 ms
[2021-05-09 17:59:22] [INFO ] Flatten gal took : 2 ms
[2021-05-09 17:59:22] [INFO ] Time to serialize gal into /tmp/LTL13277767998398093578.gal : 0 ms
[2021-05-09 17:59:22] [INFO ] Time to serialize properties into /tmp/LTL4754048925844381930.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/LTL13277767998398093578.gal, -t, CGAL, -LTL, /tmp/LTL4754048925844381930.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/LTL13277767998398093578.gal -t CGAL -LTL /tmp/LTL4754048925844381930.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p4<1)||((p10>=1)&&(p28>=1)))"))))
Formula 0 simplified : !GF"((p4<1)||((p10>=1)&&(p28>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t38.t12, t46.t47, t43.t44.t45, t1.t2.t3.t4.t5.t6.t13.t17, t16.t7, t25.t8.t9.t26.t30, t28.t29.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/7/22
Computing Next relation with stutter on 16 deadlock states
40 unique states visited
0 strongly connected components in search stack
42 transitions explored
39 items max in DFS search stack
3 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.037856,17580,1,0,121,4404,74,131,811,6294,370
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DoubleExponent-PT-001-14 finished in 579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((G(p0)||G(F(p1)))) U (p2||F(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 52 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 46 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 46 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 42 transition count 37
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 36 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 33 transition count 28
Applied a total of 37 rules in 3 ms. Remains 33 /53 variables (removed 20) and now considering 28/48 (removed 20) transitions.
// Phase 1: matrix 28 rows 33 cols
[2021-05-09 17:59:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 28 rows 33 cols
[2021-05-09 17:59:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 17:59:22] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-09 17:59:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 33 cols
[2021-05-09 17:59:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 17:59:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/53 places, 28/48 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-15 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s24 1)), p3:(GEQ s21 1), p0:(OR (LT s3 1) (LT s22 1)), p1:(AND (GEQ s7 1) (GEQ s13 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 5533 steps with 475 reset in 6 ms.
FORMULA DoubleExponent-PT-001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-15 finished in 148 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620583164015

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

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