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.r109-tall-171624208500392.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 DES-PT-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500392
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 08:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 68K 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 DES-PT-01b-LTLCardinality-00
FORMULA_NAME DES-PT-01b-LTLCardinality-01
FORMULA_NAME DES-PT-01b-LTLCardinality-02
FORMULA_NAME DES-PT-01b-LTLCardinality-03
FORMULA_NAME DES-PT-01b-LTLCardinality-04
FORMULA_NAME DES-PT-01b-LTLCardinality-05
FORMULA_NAME DES-PT-01b-LTLCardinality-06
FORMULA_NAME DES-PT-01b-LTLCardinality-07
FORMULA_NAME DES-PT-01b-LTLCardinality-08
FORMULA_NAME DES-PT-01b-LTLCardinality-09
FORMULA_NAME DES-PT-01b-LTLCardinality-10
FORMULA_NAME DES-PT-01b-LTLCardinality-11
FORMULA_NAME DES-PT-01b-LTLCardinality-12
FORMULA_NAME DES-PT-01b-LTLCardinality-13
FORMULA_NAME DES-PT-01b-LTLCardinality-14
FORMULA_NAME DES-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716332429212

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=DES-PT-01b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 23:00:32] [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-21 23:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:00:32] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-21 23:00:32] [INFO ] Transformed 284 places.
[2024-05-21 23:00:32] [INFO ] Transformed 235 transitions.
[2024-05-21 23:00:32] [INFO ] Found NUPN structural information;
[2024-05-21 23:00:32] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 133 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.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-01b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 259 transition count 213
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 259 transition count 213
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 245 transition count 199
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 245 transition count 199
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 86 place count 245 transition count 188
Applied a total of 86 rules in 52 ms. Remains 245 /284 variables (removed 39) and now considering 188/235 (removed 47) transitions.
// Phase 1: matrix 188 rows 245 cols
[2024-05-21 23:00:32] [INFO ] Computed 62 invariants in 18 ms
[2024-05-21 23:00:32] [INFO ] Implicit Places using invariants in 268 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/284 places, 188/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 243/284 places, 188/235 transitions.
Support contains 17 out of 243 places after structural reductions.
[2024-05-21 23:00:32] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:00:32] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:00:32] [INFO ] Input system was already deterministic with 188 transitions.
Finished random walk after 906 steps, including 8 resets, run visited all 10 properties in 639 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 53 stabilizing places and 49 stable transitions
Graph (complete) has 430 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 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' '!((p0 U (X(F(p1))&&G(!p0))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 238 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 238 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 237 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 237 transition count 179
Applied a total of 15 rules in 16 ms. Remains 237 /243 variables (removed 6) and now considering 179/188 (removed 9) transitions.
// Phase 1: matrix 179 rows 237 cols
[2024-05-21 23:00:33] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 23:00:33] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:00:33] [INFO ] Invariant cache hit.
[2024-05-21 23:00:34] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-21 23:00:34] [INFO ] Invariant cache hit.
[2024-05-21 23:00:34] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/243 places, 179/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 237/243 places, 179/188 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 257 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(EQ s195 1), p1:(OR (EQ s147 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 3 ms.
FORMULA DES-PT-01b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLCardinality-01 finished in 764 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(p0))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Graph (complete) has 430 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 237 transition count 164
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 217 transition count 163
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 42 place count 217 transition count 151
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 66 place count 205 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 202 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 202 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 201 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 201 transition count 145
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 222 place count 128 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 228 place count 125 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 123 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 232 place count 121 transition count 78
Applied a total of 232 rules in 50 ms. Remains 121 /243 variables (removed 122) and now considering 78/188 (removed 110) transitions.
// Phase 1: matrix 78 rows 121 cols
[2024-05-21 23:00:34] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:00:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:00:34] [INFO ] Invariant cache hit.
[2024-05-21 23:00:34] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [7, 29, 33, 37, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 93, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 193 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/243 places, 78/188 transitions.
Graph (complete) has 232 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 96 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 86 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 85 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 85 transition count 58
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 61 place count 59 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 57 transition count 45
Applied a total of 64 rules in 10 ms. Remains 57 /99 variables (removed 42) and now considering 45/78 (removed 33) transitions.
// Phase 1: matrix 45 rows 57 cols
[2024-05-21 23:00:34] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 23:00:34] [INFO ] Implicit Places using invariants in 39 ms returned [41, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/243 places, 45/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 41
Applied a total of 6 rules in 6 ms. Remains 52 /55 variables (removed 3) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 52 cols
[2024-05-21 23:00:34] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 23:00:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 23:00:34] [INFO ] Invariant cache hit.
[2024-05-21 23:00:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/243 places, 41/188 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 383 ms. Remains : 52/243 places, 41/188 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14387 reset in 262 ms.
Product exploration explored 100000 steps with 14437 reset in 175 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
[2024-05-21 23:00:35] [INFO ] Invariant cache hit.
[2024-05-21 23:00:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 23:00:35] [INFO ] [Real]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 23:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:00:35] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 23:00:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 23:00:35] [INFO ] [Nat]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 23:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:00:35] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 23:00:35] [INFO ] Computed and/alt/rep : 33/96/33 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 23:00:35] [INFO ] Added : 21 causal constraints over 5 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-21 23:00:35] [INFO ] Invariant cache hit.
[2024-05-21 23:00:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 23:00:35] [INFO ] Invariant cache hit.
[2024-05-21 23:00:35] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-21 23:00:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:00:35] [INFO ] Invariant cache hit.
[2024-05-21 23:00:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 52/52 places, 41/41 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0)]
[2024-05-21 23:00:36] [INFO ] Invariant cache hit.
[2024-05-21 23:00:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-21 23:00:36] [INFO ] [Real]Absence check using 12 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 23:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:00:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 23:00:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-05-21 23:00:36] [INFO ] [Nat]Absence check using 12 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 23:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:00:36] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 23:00:36] [INFO ] Computed and/alt/rep : 33/96/33 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 23:00:36] [INFO ] Added : 21 causal constraints over 5 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14324 reset in 182 ms.
Product exploration explored 100000 steps with 14329 reset in 173 ms.
Built C files in :
/tmp/ltsmin10171531688590992370
[2024-05-21 23:00:36] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-21 23:00:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:36] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-21 23:00:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:37] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-21 23:00:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10171531688590992370
Running compilation step : cd /tmp/ltsmin10171531688590992370;'/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 229 ms.
Running link step : cd /tmp/ltsmin10171531688590992370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10171531688590992370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16944295248155039876.hoa' '--buchi-type=spotba'
LTSmin run took 96 ms.
FORMULA DES-PT-01b-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLCardinality-02 finished in 3011 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 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 237 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 237 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 237 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 236 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 236 transition count 178
Applied a total of 17 rules in 20 ms. Remains 236 /243 variables (removed 7) and now considering 178/188 (removed 10) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-21 23:00:37] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 23:00:37] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 23:00:37] [INFO ] Invariant cache hit.
[2024-05-21 23:00:37] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-21 23:00:37] [INFO ] Invariant cache hit.
[2024-05-21 23:00:37] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/243 places, 178/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 236/243 places, 178/188 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s8 0) (NEQ s122 1))], 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 20326 reset in 141 ms.
Product exploration explored 100000 steps with 20326 reset in 123 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 556 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-21 23:00:39] [INFO ] Invariant cache hit.
[2024-05-21 23:00:39] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:00:39] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-21 23:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:00:39] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-21 23:00:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:00:39] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-21 23:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:00:39] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-05-21 23:00:39] [INFO ] Computed and/alt/rep : 176/289/176 causal constraints (skipped 1 transitions) in 12 ms.
[2024-05-21 23:00:40] [INFO ] Added : 89 causal constraints over 18 iterations in 440 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 230 transition count 156
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 212 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 212 transition count 144
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 61 place count 200 transition count 144
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 209 place count 126 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 213 place count 124 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 123 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 216 place count 121 transition count 71
Applied a total of 216 rules in 27 ms. Remains 121 /236 variables (removed 115) and now considering 71/178 (removed 107) transitions.
// Phase 1: matrix 71 rows 121 cols
[2024-05-21 23:00:40] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 23:00:40] [INFO ] Invariant cache hit.
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [8, 30, 34, 38, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 95, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 178 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/236 places, 71/178 transitions.
Graph (complete) has 230 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 96 transition count 69
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3 place count 96 transition count 61
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 19 place count 88 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 58 place count 62 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 60 transition count 47
Applied a total of 61 rules in 10 ms. Remains 60 /99 variables (removed 39) and now considering 47/71 (removed 24) transitions.
// Phase 1: matrix 47 rows 60 cols
[2024-05-21 23:00:40] [INFO ] Computed 19 invariants in 0 ms
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants in 39 ms returned [38, 46, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/236 places, 47/178 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 55 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 55 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 54 transition count 43
Applied a total of 6 rules in 5 ms. Remains 54 /57 variables (removed 3) and now considering 43/47 (removed 4) transitions.
// Phase 1: matrix 43 rows 54 cols
[2024-05-21 23:00:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 23:00:40] [INFO ] Invariant cache hit.
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/236 places, 43/178 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 352 ms. Remains : 54/236 places, 43/178 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLCardinality-08 finished in 3171 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(X(X(F(p0))))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 238 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 238 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 238 transition count 180
Applied a total of 13 rules in 6 ms. Remains 238 /243 variables (removed 5) and now considering 180/188 (removed 8) transitions.
// Phase 1: matrix 180 rows 238 cols
[2024-05-21 23:00:40] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 23:00:40] [INFO ] Invariant cache hit.
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-21 23:00:40] [INFO ] Invariant cache hit.
[2024-05-21 23:00:40] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/243 places, 180/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 238/243 places, 180/188 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s67 0) (EQ s222 1))], 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 101 ms.
Product exploration explored 100000 steps with 20000 reset in 105 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 926 steps, including 9 resets, run visited all 1 properties in 13 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 23:00:42] [INFO ] Invariant cache hit.
[2024-05-21 23:00:42] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 23:00:42] [INFO ] Invariant cache hit.
[2024-05-21 23:00:42] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-21 23:00:42] [INFO ] Invariant cache hit.
[2024-05-21 23:00:42] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 238/238 places, 180/180 transitions.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 644 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1388 steps, including 13 resets, run visited all 1 properties in 11 ms. (steps per millisecond=126 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Product exploration explored 100000 steps with 20000 reset in 99 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 180/180 transitions.
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 233 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 18 place count 233 transition count 179
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 28 place count 233 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 227 transition count 173
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 227 transition count 173
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 115 place count 227 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 218 transition count 167
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 218 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 139 place count 218 transition count 195
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 216 transition count 189
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 216 transition count 189
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 143 rules in 53 ms. Remains 216 /238 variables (removed 22) and now considering 189/180 (removed -9) transitions.
[2024-05-21 23:00:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 189 rows 216 cols
[2024-05-21 23:00:45] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:00:45] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 216/238 places, 189/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 216/238 places, 189/180 transitions.
Built C files in :
/tmp/ltsmin8217379290836753338
[2024-05-21 23:00:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8217379290836753338
Running compilation step : cd /tmp/ltsmin8217379290836753338;'/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 279 ms.
Running link step : cd /tmp/ltsmin8217379290836753338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8217379290836753338;'/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/stateBased13972836748670964629.hoa' '--buchi-type=spotba'
LTSmin run took 150 ms.
FORMULA DES-PT-01b-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLCardinality-09 finished in 5007 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 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Graph (complete) has 430 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 237 transition count 163
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 216 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 216 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 203 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 201 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 201 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 201 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 200 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 200 transition count 145
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 219 place count 129 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 127 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 125 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 123 transition count 74
Applied a total of 227 rules in 27 ms. Remains 123 /243 variables (removed 120) and now considering 74/188 (removed 114) transitions.
// Phase 1: matrix 74 rows 123 cols
[2024-05-21 23:00:45] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:00:45] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 23:00:45] [INFO ] Invariant cache hit.
[2024-05-21 23:00:45] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [9, 31, 35, 39, 44, 46, 48, 50, 52, 54, 56, 58, 97, 118]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 205 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/243 places, 74/188 transitions.
Graph (complete) has 264 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 106 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 104 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 103 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 103 transition count 66
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 0 with 24 rules applied. Total rules applied 31 place count 91 transition count 54
Applied a total of 31 rules in 6 ms. Remains 91 /109 variables (removed 18) and now considering 54/74 (removed 20) transitions.
// Phase 1: matrix 54 rows 91 cols
[2024-05-21 23:00:45] [INFO ] Computed 41 invariants in 0 ms
[2024-05-21 23:00:46] [INFO ] Implicit Places using invariants in 153 ms returned [71, 77, 80]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 153 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/243 places, 54/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 85 transition count 50
Applied a total of 6 rules in 5 ms. Remains 85 /88 variables (removed 3) and now considering 50/54 (removed 4) transitions.
// Phase 1: matrix 50 rows 85 cols
[2024-05-21 23:00:46] [INFO ] Computed 38 invariants in 0 ms
[2024-05-21 23:00:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 23:00:46] [INFO ] Invariant cache hit.
[2024-05-21 23:00:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:00:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 85/243 places, 50/188 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 536 ms. Remains : 85/243 places, 50/188 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 1 ms.
FORMULA DES-PT-01b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLCardinality-13 finished in 580 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' '!((G(p0)||(F((p1&&X(p2)))&&X(F(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 188/188 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 240 transition count 185
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 240 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 240 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 239 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 239 transition count 183
Applied a total of 9 rules in 9 ms. Remains 239 /243 variables (removed 4) and now considering 183/188 (removed 5) transitions.
// Phase 1: matrix 183 rows 239 cols
[2024-05-21 23:00:46] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:00:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:00:46] [INFO ] Invariant cache hit.
[2024-05-21 23:00:46] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-21 23:00:46] [INFO ] Invariant cache hit.
[2024-05-21 23:00:46] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/243 places, 183/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 239/243 places, 183/188 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}, { cond=(AND p0 p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s29 0) (EQ s19 1)) (OR (EQ s34 0) (EQ s98 1))), p1:(OR (EQ s39 0) (EQ s83 1)), p3:(EQ s86 1), p2:(AND (EQ s83 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4546 reset in 165 ms.
Product exploration explored 100000 steps with 4660 reset in 164 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 422 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1 (NOT p2))), (X (NOT p3)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT p3))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 141 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 23:00:47] [INFO ] Invariant cache hit.
[2024-05-21 23:00:47] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 23:00:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:00:48] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 8 ms returned sat
[2024-05-21 23:00:48] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1 (NOT p2))), (X (NOT p3)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT p3))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F p3), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 32 factoid took 700 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 415 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Support contains 7 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 183/183 transitions.
Graph (complete) has 422 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 233 transition count 163
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 217 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 216 transition count 162
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 216 transition count 151
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 205 transition count 151
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 197 place count 135 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 134 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 132 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 130 transition count 80
Applied a total of 203 rules in 27 ms. Remains 130 /239 variables (removed 109) and now considering 80/183 (removed 103) transitions.
// Phase 1: matrix 80 rows 130 cols
[2024-05-21 23:00:49] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:00:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 23:00:49] [INFO ] Invariant cache hit.
[2024-05-21 23:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:00:49] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [48, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 104, 125]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 223 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/239 places, 80/183 transitions.
Graph (complete) has 248 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 108 transition count 68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 98 transition count 68
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 55 place count 74 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 72 transition count 57
Applied a total of 58 rules in 6 ms. Remains 72 /111 variables (removed 39) and now considering 57/80 (removed 23) transitions.
// Phase 1: matrix 57 rows 72 cols
[2024-05-21 23:00:49] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 23:00:49] [INFO ] Implicit Places using invariants in 47 ms returned [58, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/239 places, 57/183 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 68 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 67 transition count 53
Applied a total of 6 rules in 4 ms. Remains 67 /70 variables (removed 3) and now considering 53/57 (removed 4) transitions.
// Phase 1: matrix 53 rows 67 cols
[2024-05-21 23:00:49] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 23:00:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 23:00:49] [INFO ] Invariant cache hit.
[2024-05-21 23:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:00:50] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 67/239 places, 53/183 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 405 ms. Remains : 67/239 places, 53/183 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p3))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p3)), (X p3), (X (NOT p2)), (X p2), (X (X (AND p0 (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2 p3))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
Knowledge based reduction with 10 factoid took 1138 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter insensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Finished random walk after 133 steps, including 7 resets, run visited all 14 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p3))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p3)), (X p3), (X (NOT p2)), (X p2), (X (X (AND p0 (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2 p3))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p0 p2 p3)), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) (NOT p2) p3)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 (NOT p2) p3)), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) p2 p3)), (F (AND (NOT p0) (NOT p3))), (F (NOT (OR p0 p3))), (F (AND (NOT p0) (NOT p2))), (F p2), (F p3)]
Knowledge based reduction with 10 factoid took 1567 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter insensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 965 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 432 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 445 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 29347 reset in 164 ms.
Product exploration explored 100000 steps with 29350 reset in 182 ms.
Built C files in :
/tmp/ltsmin15954810322889929940
[2024-05-21 23:00:55] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-21 23:00:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:55] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-21 23:00:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:55] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-21 23:00:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:55] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15954810322889929940
Running compilation step : cd /tmp/ltsmin15954810322889929940;'/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 146 ms.
Running link step : cd /tmp/ltsmin15954810322889929940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15954810322889929940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10120634279538484214.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA DES-PT-01b-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLCardinality-14 finished in 9511 ms.
All properties solved by simple procedures.
Total runtime 23678 ms.

BK_STOP 1716332459048

--------------------
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="DES-PT-01b"
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 DES-PT-01b, 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 r109-tall-171624208500392"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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