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-162048875300396.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300396
=====================================================================

--------------------
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 1620583130167

Running Version 0
[2021-05-09 17:58:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 17:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:58:51] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-09 17:58:51] [INFO ] Transformed 57 places.
[2021-05-09 17:58:51] [INFO ] Transformed 48 transitions.
[2021-05-09 17:58:51] [INFO ] Parsed PT model containing 57 places and 48 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:58:51] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-001-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 48
Applied a total of 1 rules in 10 ms. Remains 56 /57 variables (removed 1) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 56 cols
[2021-05-09 17:58:51] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-09 17:58:51] [INFO ] Implicit Places using invariants in 100 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
// Phase 1: matrix 48 rows 54 cols
[2021-05-09 17:58:51] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-09 17:58:52] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 54 cols
[2021-05-09 17:58:52] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 17:58:52] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 48/48 transitions.
[2021-05-09 17:58:52] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 17:58:52] [INFO ] Flatten gal took : 24 ms
FORMULA DoubleExponent-PT-001-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:58:52] [INFO ] Flatten gal took : 9 ms
[2021-05-09 17:58:52] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 100000 steps, including 3290 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 20) seen :15
Running SMT prover for 5 properties.
// Phase 1: matrix 48 rows 54 cols
[2021-05-09 17:58:52] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 17:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:58:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:58:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 17:58:52] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2021-05-09 17:58:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-09 17:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:58:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:58:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 17:58:52] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 7 ms to minimize.
[2021-05-09 17:58:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 17:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:58:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 17:58:52] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 1 ms to minimize.
[2021-05-09 17:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-09 17:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:58:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 17:58:53] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 17:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:58:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 17:58:53] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2021-05-09 17:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-09 17:58:53] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 17:58:53] [INFO ] Added : 46 causal constraints over 10 iterations in 69 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
[2021-05-09 17:58:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-001-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 51 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 51 transition count 47
Applied a total of 4 rules in 6 ms. Remains 51 /54 variables (removed 3) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 17:58:53] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 17:58:53] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 17:58:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 17:58:53] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 17:58:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 47/48 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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=(AND 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}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT 1 s45), p1:(LEQ 3 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3378 reset in 212 ms.
Product exploration explored 100000 steps with 3387 reset in 146 ms.
Graph (complete) has 77 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3365 reset in 117 ms.
Product exploration explored 100000 steps with 3351 reset in 138 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 51/51 places, 47/47 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 51 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 12 place count 51 transition count 48
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 51 transition count 48
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 49 transition count 46
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 49 transition count 46
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 48 transition count 47
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 48 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 48 transition count 52
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 45 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 45 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 40 rules in 20 ms. Remains 45 /51 variables (removed 6) and now considering 46/47 (removed 1) transitions.
[2021-05-09 17:58:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 46 rows 45 cols
[2021-05-09 17:58:54] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-09 17:58:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/51 places, 46/47 transitions.
Product exploration explored 100000 steps with 9881 reset in 351 ms.
Product exploration explored 100000 steps with 9946 reset in 190 ms.
[2021-05-09 17:58:55] [INFO ] Flatten gal took : 5 ms
[2021-05-09 17:58:55] [INFO ] Flatten gal took : 4 ms
[2021-05-09 17:58:55] [INFO ] Time to serialize gal into /tmp/LTL13593785591846417883.gal : 1 ms
[2021-05-09 17:58:55] [INFO ] Time to serialize properties into /tmp/LTL4947756000847226305.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/LTL13593785591846417883.gal, -t, CGAL, -LTL, /tmp/LTL4947756000847226305.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/LTL13593785591846417883.gal -t CGAL -LTL /tmp/LTL4947756000847226305.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p53<1)"))||(("(p53<1)")&&(F("(p57>=3)")))))))
Formula 0 simplified : !XF(G"(p53<1)" | ("(p53<1)" & F"(p57>=3)"))
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
11 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.129796,21372,1,0,399,19408,131,361,1424,22789,866
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DoubleExponent-PT-001-01 finished in 2126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 51 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 51 transition count 47
Applied a total of 4 rules in 4 ms. Remains 51 /54 variables (removed 3) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 17:58:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:55] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 17:58:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 17:58:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:55] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 47/48 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
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={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 1 s9) (GT 3 s47))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Graph (complete) has 77 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 51/51 places, 47/47 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 51 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 12 place count 51 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 51 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 50 transition count 47
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 50 transition count 47
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 49 transition count 48
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 49 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 49 transition count 52
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 46 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 46 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 37 rules in 11 ms. Remains 46 /51 variables (removed 5) and now considering 46/47 (removed 1) transitions.
[2021-05-09 17:58:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 46 cols
[2021-05-09 17:58:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:56] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/51 places, 46/47 transitions.
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
[2021-05-09 17:58:56] [INFO ] Flatten gal took : 4 ms
[2021-05-09 17:58:56] [INFO ] Flatten gal took : 3 ms
[2021-05-09 17:58:56] [INFO ] Time to serialize gal into /tmp/LTL13895223183293939444.gal : 1 ms
[2021-05-09 17:58:56] [INFO ] Time to serialize properties into /tmp/LTL7970299770108838103.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/LTL13895223183293939444.gal, -t, CGAL, -LTL, /tmp/LTL7970299770108838103.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/LTL13895223183293939444.gal -t CGAL -LTL /tmp/LTL7970299770108838103.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p18<1)&&(p57<3))"))))
Formula 0 simplified : !XF"((p18<1)&&(p57<3))"
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
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 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.066263,18580,1,0,87,8344,120,52,1423,4793,107
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-001-02 finished in 1574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 50 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 50 transition count 47
Applied a total of 5 rules in 4 ms. Remains 50 /54 variables (removed 4) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:56] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 17:58:56] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:56] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-09 17:58:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:56] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-09 17:58:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/54 places, 47/48 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0), (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}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 1 s39)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 78 ms.
Product exploration explored 100000 steps with 25000 reset in 86 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 : [p0]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Product exploration explored 100000 steps with 25000 reset in 84 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 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 13 place count 50 transition count 48
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 50 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 46 transition count 44
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 46 transition count 44
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 35 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 45 transition count 44
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 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 45 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 42 transition count 43
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 42 transition count 43
Deduced a syphon composed of 21 places in 1 ms
Applied a total of 45 rules in 10 ms. Remains 42 /50 variables (removed 8) and now considering 43/47 (removed 4) transitions.
[2021-05-09 17:58:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 42 cols
[2021-05-09 17:58:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/50 places, 43/47 transitions.
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Product exploration explored 100000 steps with 25000 reset in 166 ms.
[2021-05-09 17:58:58] [INFO ] Flatten gal took : 4 ms
[2021-05-09 17:58:58] [INFO ] Flatten gal took : 6 ms
[2021-05-09 17:58:58] [INFO ] Time to serialize gal into /tmp/LTL7041926477199704810.gal : 1 ms
[2021-05-09 17:58:58] [INFO ] Time to serialize properties into /tmp/LTL11506141095318665735.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/LTL7041926477199704810.gal, -t, CGAL, -LTL, /tmp/LTL11506141095318665735.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/LTL7041926477199704810.gal -t CGAL -LTL /tmp/LTL11506141095318665735.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p48<1)"))))))
Formula 0 simplified : !XXXF"(p48<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
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
4 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.056029,18280,1,0,87,6633,120,54,1396,3737,113
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DoubleExponent-PT-001-05 finished in 1272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Graph (complete) has 80 edges and 54 vertex of which 51 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 50 transition count 35
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 38 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 37 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 27 place count 37 transition count 31
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 33 place count 34 transition count 31
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 33 transition count 30
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 33 transition count 30
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 55 place count 23 transition count 20
Applied a total of 55 rules in 6 ms. Remains 23 /54 variables (removed 31) and now considering 20/48 (removed 28) transitions.
// Phase 1: matrix 20 rows 23 cols
[2021-05-09 17:58:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 20 rows 23 cols
[2021-05-09 17:58:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 17:58:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 23 cols
[2021-05-09 17:58:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/54 places, 20/48 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s0), p1:(LEQ 1 s18)], 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 11 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-07 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((X(F(!p2))||p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 50 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 50 transition count 47
Applied a total of 5 rules in 2 ms. Remains 50 /54 variables (removed 4) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:58] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:58] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 17:58:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/54 places, 47/48 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : DoubleExponent-PT-001-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s14 s43), p1:(OR (LEQ 2 s25) (LEQ s9 s26)), p2:(LEQ 1 s43)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 99 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 : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 5 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 50 transition count 47
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 50 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 49 transition count 46
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 49 transition count 46
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 49 transition count 47
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 47 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 47 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 47 transition count 49
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 45 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 45 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 34 rules in 10 ms. Remains 45 /50 variables (removed 5) and now considering 45/47 (removed 2) transitions.
[2021-05-09 17:58:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 45 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/50 places, 45/47 transitions.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
[2021-05-09 17:58:59] [INFO ] Flatten gal took : 3 ms
[2021-05-09 17:58:59] [INFO ] Flatten gal took : 6 ms
[2021-05-09 17:58:59] [INFO ] Time to serialize gal into /tmp/LTL18052474712381270874.gal : 1 ms
[2021-05-09 17:58:59] [INFO ] Time to serialize properties into /tmp/LTL11925437047014489496.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/LTL18052474712381270874.gal, -t, CGAL, -LTL, /tmp/LTL11925437047014489496.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/LTL18052474712381270874.gal -t CGAL -LTL /tmp/LTL11925437047014489496.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p23<=p51)")||(X(F(("((p35>=2)||(p18<=p36))")||(X(F("(p51<1)")))))))))
Formula 0 simplified : !X("(p23<=p51)" | XF("((p35>=2)||(p18<=p36))" | XF"(p51<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
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
4 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.055773,18360,1,0,87,6633,114,52,1398,3700,105
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DoubleExponent-PT-001-09 finished in 1276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Graph (complete) has 80 edges and 54 vertex of which 51 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 34
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 37 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 37 transition count 32
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 35 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 34 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 34 transition count 31
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 59 place count 22 transition count 19
Applied a total of 59 rules in 5 ms. Remains 22 /54 variables (removed 32) and now considering 19/48 (removed 29) transitions.
// Phase 1: matrix 19 rows 22 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 19 rows 22 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 17:58:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-09 17:58:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 22 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/54 places, 19/48 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-10 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:(GT s11 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-10 finished in 127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 48
Applied a total of 3 rules in 1 ms. Remains 51 /54 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 17:58:59] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 48 rows 51 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 48/48 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-001-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT s26 s11), p0:(LEQ 1 s33)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-13 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((G(p0)||X(G(p1))) U !p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 50 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 50 transition count 47
Applied a total of 5 rules in 1 ms. Remains 50 /54 variables (removed 4) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-09 17:58:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 47 rows 50 cols
[2021-05-09 17:58:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:58:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/54 places, 47/48 transitions.
Stuttering acceptance computed with spot in 184 ms :[p0, false, p0, (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-15 automaton TGBA [mat=[[{ cond=true, acceptance={0, 2} source=0 dest: 0}, { cond=p0, acceptance={1, 2} source=0 dest: 1}, { cond=p0, acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={2} source=1 dest: 5}], [{ cond=p0, acceptance={1, 2} source=2 dest: 1}, { cond=p0, acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0, 2} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={2} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s8 s34), p1:(LEQ s46 s16)], nbAcceptance=3, 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 3360 reset in 206 ms.
Product exploration explored 100000 steps with 3347 reset in 190 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 : [p0, p1]
Stuttering acceptance computed with spot in 192 ms :[p0, false, p0, (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3303 reset in 104 ms.
Product exploration explored 100000 steps with 3327 reset in 135 ms.
Applying partial POR strategy [true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[p0, false, p0, (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1))]
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 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 11 place count 50 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 50 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 46 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 46 transition count 44
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 32 place count 46 transition count 45
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 32 rules in 5 ms. Remains 46 /50 variables (removed 4) and now considering 45/47 (removed 2) transitions.
[2021-05-09 17:59:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 46 cols
[2021-05-09 17:59:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 17:59:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/50 places, 45/47 transitions.
Stuttering criterion allowed to conclude after 8212 steps with 763 reset in 18 ms.
FORMULA DoubleExponent-PT-001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-15 finished in 1530 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620583142150

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875300396"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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