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.r597-smll-171734926400067.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 MedleyA-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 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 MedleyA-PT-14-LTLCardinality-00
FORMULA_NAME MedleyA-PT-14-LTLCardinality-01
FORMULA_NAME MedleyA-PT-14-LTLCardinality-02
FORMULA_NAME MedleyA-PT-14-LTLCardinality-03
FORMULA_NAME MedleyA-PT-14-LTLCardinality-04
FORMULA_NAME MedleyA-PT-14-LTLCardinality-05
FORMULA_NAME MedleyA-PT-14-LTLCardinality-06
FORMULA_NAME MedleyA-PT-14-LTLCardinality-07
FORMULA_NAME MedleyA-PT-14-LTLCardinality-08
FORMULA_NAME MedleyA-PT-14-LTLCardinality-09
FORMULA_NAME MedleyA-PT-14-LTLCardinality-10
FORMULA_NAME MedleyA-PT-14-LTLCardinality-11
FORMULA_NAME MedleyA-PT-14-LTLCardinality-12
FORMULA_NAME MedleyA-PT-14-LTLCardinality-13
FORMULA_NAME MedleyA-PT-14-LTLCardinality-14
FORMULA_NAME MedleyA-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362667816

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=MedleyA-PT-14
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:11:10] [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-06-02 21:11:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:11:10] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 21:11:11] [INFO ] Transformed 184 places.
[2024-06-02 21:11:11] [INFO ] Transformed 178 transitions.
[2024-06-02 21:11:11] [INFO ] Found NUPN structural information;
[2024-06-02 21:11:11] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 148
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 148 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 148 transition count 142
Applied a total of 72 rules in 174 ms. Remains 148 /184 variables (removed 36) and now considering 142/178 (removed 36) transitions.
// Phase 1: matrix 142 rows 148 cols
[2024-06-02 21:11:11] [INFO ] Computed 24 invariants in 11 ms
[2024-06-02 21:11:11] [INFO ] Implicit Places using invariants in 330 ms returned [39, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 383 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/184 places, 142/178 transitions.
Applied a total of 0 rules in 11 ms. Remains 146 /146 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 569 ms. Remains : 146/184 places, 142/178 transitions.
Support contains 23 out of 146 places after structural reductions.
[2024-06-02 21:11:12] [INFO ] Flatten gal took : 57 ms
[2024-06-02 21:11:12] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:11:12] [INFO ] Input system was already deterministic with 142 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 863 ms. (steps per millisecond=11 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 142 rows 146 cols
[2024-06-02 21:11:14] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:11:14] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 21:11:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-02 21:11:14] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 21:11:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-02 21:11:14] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-02 21:11:14] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 21:11:14] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 9 ms to minimize.
[2024-06-02 21:11:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:11:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 171 ms
[2024-06-02 21:11:14] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-06-02 21:11:14] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 7 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 142/142 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 146 transition count 136
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 140 transition count 136
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 12 place count 140 transition count 119
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 46 place count 123 transition count 119
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 116 transition count 112
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 116 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 60 place count 116 transition count 108
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 112 transition count 108
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 114 place count 89 transition count 85
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -27
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 140 place count 76 transition count 112
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 76 transition count 111
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 76 transition count 109
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 74 transition count 108
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 149 place count 74 transition count 108
Applied a total of 149 rules in 73 ms. Remains 74 /146 variables (removed 72) and now considering 108/142 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 74/146 places, 108/142 transitions.
Finished random walk after 125 steps, including 7 resets, run visited all 2 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
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 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 8 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
// Phase 1: matrix 132 rows 136 cols
[2024-06-02 21:11:15] [INFO ] Computed 22 invariants in 9 ms
[2024-06-02 21:11:15] [INFO ] Implicit Places using invariants in 144 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 132/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 135/146 places, 132/142 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 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s25 0)], 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 459 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 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 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-00 finished in 1253 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 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 145 transition count 134
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 138 transition count 134
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 138 transition count 116
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 120 transition count 116
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 112 transition count 108
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 112 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 66 place count 112 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 108 transition count 104
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 116 place count 87 transition count 83
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -27
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 142 place count 74 transition count 110
Applied a total of 142 rules in 42 ms. Remains 74 /146 variables (removed 72) and now considering 110/142 (removed 32) transitions.
// Phase 1: matrix 110 rows 74 cols
[2024-06-02 21:11:16] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:11:16] [INFO ] Implicit Places using invariants in 127 ms returned [6, 10, 27, 31, 46, 50, 59]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 131 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/146 places, 110/142 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 67 transition count 106
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 106
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 14 place count 60 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 20 place count 57 transition count 109
Applied a total of 20 rules in 12 ms. Remains 57 /67 variables (removed 10) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 57 cols
[2024-06-02 21:11:16] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:11:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 21:11:16] [INFO ] Invariant cache hit.
[2024-06-02 21:11:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 21:11:16] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [11, 27, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 265 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/146 places, 109/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 108
Applied a total of 2 rules in 7 ms. Remains 53 /54 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 53 cols
[2024-06-02 21:11:16] [INFO ] Computed 12 invariants in 4 ms
[2024-06-02 21:11:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:11:17] [INFO ] Invariant cache hit.
[2024-06-02 21:11:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 21:11:17] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 53/146 places, 108/142 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 680 ms. Remains : 53/146 places, 108/142 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-02 finished in 887 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 U X(p1)) U p0)))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 7 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
// Phase 1: matrix 132 rows 136 cols
[2024-06-02 21:11:17] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:11:17] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-02 21:11:17] [INFO ] Invariant cache hit.
[2024-06-02 21:11:17] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-06-02 21:11:17] [INFO ] Invariant cache hit.
[2024-06-02 21:11:18] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/146 places, 132/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 136/146 places, 132/142 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s107 1)), p1:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 359 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :2
Finished Best-First random walk after 381 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=381 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-02 21:11:19] [INFO ] Invariant cache hit.
[2024-06-02 21:11:19] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 21:11:19] [INFO ] Invariant cache hit.
[2024-06-02 21:11:19] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 21:11:19] [INFO ] Invariant cache hit.
[2024-06-02 21:11:19] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 136/136 places, 132/132 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:11:20] [INFO ] Invariant cache hit.
[2024-06-02 21:11:20] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:11:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-02 21:11:20] [INFO ] [Nat]Absence check using 16 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:11:20] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:11:20] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 21:11:20] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 21:11:20] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 34 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 349 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 132/132 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 136 transition count 132
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 6 place count 136 transition count 149
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 28 place count 136 transition count 149
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 49 place count 136 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 133 transition count 146
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 133 transition count 146
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 133 transition count 205
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 122 transition count 183
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 122 transition count 183
Deduced a syphon composed of 47 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 122 transition count 182
Deduced a syphon composed of 47 places in 1 ms
Applied a total of 90 rules in 59 ms. Remains 122 /136 variables (removed 14) and now considering 182/132 (removed -50) transitions.
[2024-06-02 21:11:22] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 182 rows 122 cols
[2024-06-02 21:11:22] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:11:22] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/136 places, 182/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 122/136 places, 182/132 transitions.
Built C files in :
/tmp/ltsmin1729251441109649183
[2024-06-02 21:11:22] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1729251441109649183
Running compilation step : cd /tmp/ltsmin1729251441109649183;'/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 557 ms.
Running link step : cd /tmp/ltsmin1729251441109649183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1729251441109649183;'/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/stateBased13557376905037494829.hoa' '--buchi-type=spotba'
LTSmin run took 7653 ms.
FORMULA MedleyA-PT-14-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-04 finished in 13575 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((p0&&X((G(p1) U X(p0))))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 138 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 138 transition count 134
Applied a total of 16 rules in 9 ms. Remains 138 /146 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 138 cols
[2024-06-02 21:11:31] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:11:31] [INFO ] Implicit Places using invariants in 108 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/146 places, 134/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 137/146 places, 134/142 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s48 1), p1:(OR (EQ s72 0) (EQ s101 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-06 finished in 579 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)||((G(!p0)||(!p0&&G(F(!p1))))&&X(!p2)))))'
Support contains 6 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 139 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 139 transition count 135
Applied a total of 14 rules in 8 ms. Remains 139 /146 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 139 cols
[2024-06-02 21:11:31] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:11:31] [INFO ] Implicit Places using invariants in 118 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 135/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 138/146 places, 135/142 transitions.
Stuttering acceptance computed with spot in 265 ms :[p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s49 1)), p2:(OR (EQ s24 0) (EQ s103 1)), p1:(OR (EQ s32 0) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 231 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 2 ms.
FORMULA MedleyA-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-08 finished in 670 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)&&F(G(p1))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 145 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 139 transition count 135
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 139 transition count 117
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 121 transition count 117
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 114 transition count 110
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 114 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 114 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 111 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 110 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 110 transition count 106
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 110 place count 90 transition count 86
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -22
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 136 place count 77 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 76 transition count 107
Applied a total of 137 rules in 31 ms. Remains 76 /146 variables (removed 70) and now considering 107/142 (removed 35) transitions.
// Phase 1: matrix 107 rows 76 cols
[2024-06-02 21:11:32] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:11:32] [INFO ] Implicit Places using invariants in 91 ms returned [6, 10, 27, 47, 51, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 92 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/146 places, 107/142 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 70 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 103
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 14 place count 63 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 18 place count 61 transition count 104
Applied a total of 18 rules in 8 ms. Remains 61 /70 variables (removed 9) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 61 cols
[2024-06-02 21:11:32] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 21:11:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:11:32] [INFO ] Invariant cache hit.
[2024-06-02 21:11:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:11:32] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [11, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 223 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/146 places, 104/142 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 359 ms. Remains : 59/146 places, 104/142 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 1), p1:(AND (OR (EQ s46 0) (EQ s27 1)) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-09 finished in 503 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(p0) U ((!p1&&X(p0))||X(G(p0)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 138 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 138 transition count 134
Applied a total of 16 rules in 4 ms. Remains 138 /146 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 138 cols
[2024-06-02 21:11:32] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:11:32] [INFO ] Implicit Places using invariants in 106 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/146 places, 134/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 137/146 places, 134/142 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s60 0) (EQ s119 1)), p1:(OR (EQ s48 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33449 reset in 174 ms.
Product exploration explored 100000 steps with 33356 reset in 188 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Finished Best-First random walk after 366 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=183 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 8 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 137 cols
[2024-06-02 21:11:34] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 21:11:34] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:11:34] [INFO ] Invariant cache hit.
[2024-06-02 21:11:34] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-02 21:11:34] [INFO ] Invariant cache hit.
[2024-06-02 21:11:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 137/137 places, 134/134 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Finished Best-First random walk after 3644 steps, including 1 resets, run visited all 3 properties in 43 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 33413 reset in 181 ms.
Product exploration explored 100000 steps with 33346 reset in 170 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 134/134 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 137 transition count 134
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 7 place count 137 transition count 149
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 27 place count 137 transition count 149
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 49 place count 137 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 134 transition count 146
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 134 transition count 146
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 134 transition count 203
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 124 transition count 183
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 124 transition count 183
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 86 rules in 25 ms. Remains 124 /137 variables (removed 13) and now considering 183/134 (removed -49) transitions.
[2024-06-02 21:11:36] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 183 rows 124 cols
[2024-06-02 21:11:36] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 21:11:36] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/137 places, 183/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 124/137 places, 183/134 transitions.
Built C files in :
/tmp/ltsmin3334206725563271115
[2024-06-02 21:11:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3334206725563271115
Running compilation step : cd /tmp/ltsmin3334206725563271115;'/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 458 ms.
Running link step : cd /tmp/ltsmin3334206725563271115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3334206725563271115;'/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/stateBased5641227527100178596.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA MedleyA-PT-14-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-11 finished in 4489 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(p0) U (X(G(p0))||(F(!p0)&&X(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 139 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 139 transition count 135
Applied a total of 14 rules in 4 ms. Remains 139 /146 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 139 cols
[2024-06-02 21:11:37] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:11:37] [INFO ] Implicit Places using invariants in 136 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 135/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 138/146 places, 135/142 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s62 0) (EQ s44 1)), p1:(AND (OR (EQ s62 0) (EQ s44 1)) (NOT (OR (EQ s73 0) (EQ s46 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 138 cols
[2024-06-02 21:11:38] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:11:38] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 135/135 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 137 transition count 127
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 130 transition count 127
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 14 place count 130 transition count 106
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 56 place count 109 transition count 106
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 100 place count 87 transition count 84
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -27
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 126 place count 74 transition count 111
Applied a total of 126 rules in 16 ms. Remains 74 /138 variables (removed 64) and now considering 111/135 (removed 24) transitions.
// Phase 1: matrix 111 rows 74 cols
[2024-06-02 21:11:38] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:11:39] [INFO ] Implicit Places using invariants in 104 ms returned [6, 10, 27, 48, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/138 places, 111/135 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 69 transition count 108
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 6 place count 66 transition count 108
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 12 place count 63 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 16 place count 61 transition count 109
Applied a total of 16 rules in 9 ms. Remains 61 /69 variables (removed 8) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 61 cols
[2024-06-02 21:11:39] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 21:11:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:11:39] [INFO ] Invariant cache hit.
[2024-06-02 21:11:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 21:11:39] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [11, 30, 45]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 234 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/138 places, 109/135 transitions.
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 2 place count 57 transition count 108
Applied a total of 2 rules in 6 ms. Remains 57 /58 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 57 cols
[2024-06-02 21:11:39] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 21:11:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:11:39] [INFO ] Invariant cache hit.
[2024-06-02 21:11:39] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 21:11:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/138 places, 108/135 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 581 ms. Remains : 57/138 places, 108/135 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 3347 steps, including 1 resets, run visited all 3 properties in 58 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Built C files in :
/tmp/ltsmin10618651360511015919
[2024-06-02 21:11:40] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-06-02 21:11:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:11:40] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-06-02 21:11:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:11:40] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-06-02 21:11:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:11:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10618651360511015919
Running compilation step : cd /tmp/ltsmin10618651360511015919;'/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 387 ms.
Running link step : cd /tmp/ltsmin10618651360511015919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10618651360511015919;'/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/stateBased14451903582920890421.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA MedleyA-PT-14-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-15 finished in 3993 ms.
All properties solved by simple procedures.
Total runtime 30441 ms.

BK_STOP 1717362702453

--------------------
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="MedleyA-PT-14"
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 MedleyA-PT-14, 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 r597-smll-171734926400067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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