Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600327.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r153-tall-171631151600327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:42 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-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421744071

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:49:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:49:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:49:05] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2024-05-22 23:49:05] [INFO ] Transformed 57 places.
[2024-05-22 23:49:05] [INFO ] Transformed 48 transitions.
[2024-05-22 23:49:05] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 12 ms. Remains 56 /57 variables (removed 1) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-22 23:49:06] [INFO ] Computed 8 invariants in 9 ms
[2024-05-22 23:49:06] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 23:49:06] [INFO ] Invariant cache hit.
[2024-05-22 23:49:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-22 23:49:06] [INFO ] Invariant cache hit.
[2024-05-22 23:49:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/57 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 56/57 places, 48/48 transitions.
Support contains 30 out of 56 places after structural reductions.
[2024-05-22 23:49:06] [INFO ] Flatten gal took : 21 ms
[2024-05-22 23:49:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:49:06] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 301 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-22 23:49:08] [INFO ] Invariant cache hit.
[2024-05-22 23:49:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:08] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 23:49:08] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 23:49:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:08] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 23:49:08] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2024-05-22 23:49:08] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-22 23:49:08] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 85 edges and 56 vertex of which 51 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 14 rules applied. Total rules applied 15 place count 50 transition count 35
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 39 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 37 transition count 33
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 30 place count 37 transition count 30
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 34 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 33 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 33 transition count 29
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 58 place count 23 transition count 19
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 23 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 21 transition count 17
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 21 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 20 transition count 16
Applied a total of 65 rules in 20 ms. Remains 20 /56 variables (removed 36) and now considering 16/48 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 20/56 places, 16/48 transitions.
Incomplete random walk after 10000 steps, including 1147 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Probably explored full state space saw : 52 states, properties seen :0
Probabilistic random walk after 103 steps, saw 52 distinct states, run finished after 13 ms. (steps per millisecond=7 ) properties seen :0
Explored full state space saw : 52 states, properties seen :0
Exhaustive walk after 103 steps, saw 52 distinct states, run finished after 2 ms. (steps per millisecond=51 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
FORMULA DoubleExponent-PT-001-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 85 edges and 56 vertex of which 51 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(p0) U p1)&&X(F(p2)))))))'
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 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 54 transition count 48
Applied a total of 2 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 54 cols
[2024-05-22 23:49:09] [INFO ] Computed 6 invariants in 4 ms
[2024-05-22 23:49:09] [INFO ] Implicit Places using invariants in 66 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 4 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-22 23:49:09] [INFO ] Computed 4 invariants in 3 ms
[2024-05-22 23:49:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:49:09] [INFO ] Invariant cache hit.
[2024-05-22 23:49:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 51/56 places, 47/48 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s18 s28), p0:(LEQ s35 s48), p2:(GT s47 s32)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7692 reset in 213 ms.
Product exploration explored 100000 steps with 7692 reset in 108 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 23:49:11] [INFO ] Invariant cache hit.
[2024-05-22 23:49:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 23:49:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:49:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 23:49:11] [INFO ] Computed and/alt/rep : 46/83/46 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 23:49:11] [INFO ] Added : 35 causal constraints over 7 iterations in 120 ms. Result :sat
Could not prove EG (NOT p2)
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 in LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-22 23:49:11] [INFO ] Invariant cache hit.
[2024-05-22 23:49:11] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 23:49:11] [INFO ] Invariant cache hit.
[2024-05-22 23:49:11] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-22 23:49:11] [INFO ] Invariant cache hit.
[2024-05-22 23:49:11] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 51/51 places, 47/47 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 23:49:12] [INFO ] Invariant cache hit.
[2024-05-22 23:49:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 23:49:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 23:49:12] [INFO ] Computed and/alt/rep : 46/83/46 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 23:49:12] [INFO ] Added : 35 causal constraints over 7 iterations in 51 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 7692 reset in 94 ms.
Product exploration explored 100000 steps with 7692 reset in 221 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Graph (complete) has 77 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 50 transition count 46
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 50 transition count 47
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 50 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 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 21 place count 47 transition count 44
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 32 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 46 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 46 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 46 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 43 transition count 43
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 43 transition count 43
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 42 rules in 20 ms. Remains 43 /51 variables (removed 8) and now considering 43/47 (removed 4) transitions.
[2024-05-22 23:49:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 43 cols
[2024-05-22 23:49:13] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 23:49:13] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/51 places, 43/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 43/51 places, 43/47 transitions.
Built C files in :
/tmp/ltsmin14464759079587472099
[2024-05-22 23:49:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14464759079587472099
Running compilation step : cd /tmp/ltsmin14464759079587472099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin14464759079587472099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14464759079587472099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1429709922654601900.hoa' '--buchi-type=spotba'
LTSmin run took 388 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLCardinality-01 finished in 5073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 85 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output 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 12 place count 53 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 42 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 23 place count 42 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 27 place count 40 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 51 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 27 transition count 21
Applied a total of 52 rules in 6 ms. Remains 27 /56 variables (removed 29) and now considering 21/48 (removed 27) transitions.
// Phase 1: matrix 21 rows 27 cols
[2024-05-22 23:49:14] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants in 67 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/56 places, 21/48 transitions.
Graph (complete) has 57 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 0 with 6 rules applied. Total rules applied 7 place count 21 transition count 17
Applied a total of 7 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 21 cols
[2024-05-22 23:49:14] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 23:49:14] [INFO ] Invariant cache hit.
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/56 places, 17/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 21/56 places, 17/48 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s18)], 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 12 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-02 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&G((p1&&F(p0)))) U (G((p0&&G((p1&&F(p0)))))||(G((p1&&F(p0)))&&p2))))))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 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 54 transition count 48
Applied a total of 2 rules in 4 ms. Remains 54 /56 variables (removed 2) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 54 cols
[2024-05-22 23:49:14] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants in 41 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 52/56 places, 48/48 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GT 3 s47), p1:(GT s37 s13), p2:(AND (GT s49 s37) (GT 3 s47))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-03 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 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 53 transition count 48
Applied a total of 3 rules in 1 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 23:49:14] [INFO ] Computed 6 invariants in 10 ms
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants in 94 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 4 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-22 23:49:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 23:49:14] [INFO ] Invariant cache hit.
[2024-05-22 23:49:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 51/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s14 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 79 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLCardinality-06 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 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 53 transition count 48
Applied a total of 3 rules in 2 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 23:49:15] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 23:49:15] [INFO ] Implicit Places using invariants in 82 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 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 10 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2024-05-22 23:49:15] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 23:49:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 23:49:15] [INFO ] Invariant cache hit.
[2024-05-22 23:49:15] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 50/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-09 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||X((G((p1||X(p2))) U (p1&&G((p1||X(p2))))))))))'
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 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 53 transition count 48
Applied a total of 3 rules in 2 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 23:49:15] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 23:49:15] [INFO ] Implicit Places using invariants in 50 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 51/56 places, 48/48 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 2 s4), p0:(LEQ 1 s12), p2:(OR (LEQ s33 s3) (LEQ 1 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16339 reset in 107 ms.
Product exploration explored 100000 steps with 16189 reset in 124 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 213 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Finished random walk after 910 steps, including 31 resets, run visited all 2 properties in 3 ms. (steps per millisecond=303 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 224 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
// Phase 1: matrix 48 rows 51 cols
[2024-05-22 23:49:17] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 23:49:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:49:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 23:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:17] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-22 23:49:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:17] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 23:49:17] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-22 23:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-22 23:49:17] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 23:49:17] [INFO ] Added : 45 causal constraints over 9 iterations in 116 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-22 23:49:17] [INFO ] Invariant cache hit.
[2024-05-22 23:49:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:49:17] [INFO ] Invariant cache hit.
[2024-05-22 23:49:17] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-22 23:49:17] [INFO ] Invariant cache hit.
[2024-05-22 23:49:17] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 51/51 places, 48/48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Finished random walk after 1347 steps, including 46 resets, run visited all 2 properties in 7 ms. (steps per millisecond=192 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
[2024-05-22 23:49:18] [INFO ] Invariant cache hit.
[2024-05-22 23:49:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 23:49:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:49:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:49:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 23:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:49:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 23:49:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-22 23:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 23:49:18] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 23:49:19] [INFO ] Added : 45 causal constraints over 9 iterations in 67 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 16143 reset in 58 ms.
Product exploration explored 100000 steps with 16152 reset in 67 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Graph (complete) has 77 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 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 10 place count 50 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 50 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 46 transition count 44
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 46 transition count 44
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 45 transition count 44
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 45 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 45 transition count 46
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 43 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 43 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 35 rules in 15 ms. Remains 43 /51 variables (removed 8) and now considering 42/48 (removed 6) transitions.
[2024-05-22 23:49:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 43 cols
[2024-05-22 23:49:19] [INFO ] Computed 4 invariants in 5 ms
[2024-05-22 23:49:19] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/51 places, 42/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 43/51 places, 42/48 transitions.
Built C files in :
/tmp/ltsmin9382001124900358274
[2024-05-22 23:49:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9382001124900358274
Running compilation step : cd /tmp/ltsmin9382001124900358274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 115 ms.
Running link step : cd /tmp/ltsmin9382001124900358274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9382001124900358274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17846907049965365285.hoa' '--buchi-type=spotba'
LTSmin run took 403 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLCardinality-15 finished in 4900 ms.
All properties solved by simple procedures.
Total runtime 14837 ms.

BK_STOP 1716421761523

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r153-tall-171631151600327"
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 ;