fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910000017
Last Updated
July 7, 2024

About the Execution of 2023-gold for CO4-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
340.752 7781.00 14546.00 455.40 TFTFFFTFFTTFFFFT normal

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.r571-tall-171734910000017.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 CO4-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910000017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 16K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 53K 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 CO4-PT-04-LTLCardinality-00
FORMULA_NAME CO4-PT-04-LTLCardinality-01
FORMULA_NAME CO4-PT-04-LTLCardinality-02
FORMULA_NAME CO4-PT-04-LTLCardinality-03
FORMULA_NAME CO4-PT-04-LTLCardinality-04
FORMULA_NAME CO4-PT-04-LTLCardinality-05
FORMULA_NAME CO4-PT-04-LTLCardinality-06
FORMULA_NAME CO4-PT-04-LTLCardinality-07
FORMULA_NAME CO4-PT-04-LTLCardinality-08
FORMULA_NAME CO4-PT-04-LTLCardinality-09
FORMULA_NAME CO4-PT-04-LTLCardinality-10
FORMULA_NAME CO4-PT-04-LTLCardinality-11
FORMULA_NAME CO4-PT-04-LTLCardinality-12
FORMULA_NAME CO4-PT-04-LTLCardinality-13
FORMULA_NAME CO4-PT-04-LTLCardinality-14
FORMULA_NAME CO4-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368572971

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=CO4-PT-04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:49:34] [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 22:49:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:49:34] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-06-02 22:49:34] [INFO ] Transformed 101 places.
[2024-06-02 22:49:34] [INFO ] Transformed 246 transitions.
[2024-06-02 22:49:34] [INFO ] Found NUPN structural information;
[2024-06-02 22:49:34] [INFO ] Parsed PT model containing 101 places and 246 transitions and 716 arcs in 111 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 5 formulas.
Ensure Unique test removed 35 transitions
Reduce redundant transitions removed 35 transitions.
FORMULA CO4-PT-04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 211/211 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 74 transition count 163
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 74 transition count 163
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 68 place count 74 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 72 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 72 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 70 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 70 transition count 141
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 70 transition count 140
Applied a total of 77 rules in 30 ms. Remains 70 /101 variables (removed 31) and now considering 140/211 (removed 71) transitions.
[2024-06-02 22:49:35] [INFO ] Flow matrix only has 110 transitions (discarded 30 similar events)
// Phase 1: matrix 110 rows 70 cols
[2024-06-02 22:49:35] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 22:49:35] [INFO ] Implicit Places using invariants in 170 ms returned [2, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/101 places, 140/211 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 139
Applied a total of 2 rules in 4 ms. Remains 67 /68 variables (removed 1) and now considering 139/140 (removed 1) transitions.
[2024-06-02 22:49:35] [INFO ] Flow matrix only has 109 transitions (discarded 30 similar events)
// Phase 1: matrix 109 rows 67 cols
[2024-06-02 22:49:35] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:49:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:49:35] [INFO ] Flow matrix only has 109 transitions (discarded 30 similar events)
[2024-06-02 22:49:35] [INFO ] Invariant cache hit.
[2024-06-02 22:49:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 22:49:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/101 places, 139/211 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 64 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 64 transition count 136
Applied a total of 4 rules in 4 ms. Remains 64 /66 variables (removed 2) and now considering 136/139 (removed 3) transitions.
[2024-06-02 22:49:35] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
// Phase 1: matrix 107 rows 64 cols
[2024-06-02 22:49:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:49:35] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 22:49:35] [INFO ] Invariant cache hit.
[2024-06-02 22:49:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 64/101 places, 136/211 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 478 ms. Remains : 64/101 places, 136/211 transitions.
Support contains 25 out of 64 places after structural reductions.
[2024-06-02 22:49:35] [INFO ] Flatten gal took : 36 ms
[2024-06-02 22:49:35] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:49:35] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 23 out of 64 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:49:36] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 22:49:36] [INFO ] Invariant cache hit.
[2024-06-02 22:49:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:49:36] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:49:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 22:49:36] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-02 22:49:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:36] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-06-02 22:49:36] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 22:49:36] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 136/136 transitions.
Graph (trivial) has 65 edges and 64 vertex of which 24 / 64 are part of one of the 3 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions removed 40 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 121 edges and 43 vertex of which 40 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 40 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 39 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 33 transition count 61
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 33 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 33 transition count 60
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 32 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 32 transition count 58
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 35 place count 27 transition count 52
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 73 edges and 27 vertex of which 23 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 5 rules applied. Total rules applied 40 place count 23 transition count 48
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 43 place count 23 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 44 place count 22 transition count 43
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 22 transition count 43
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 5 with 2 rules applied. Total rules applied 47 place count 21 transition count 42
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 49 place count 21 transition count 40
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 54 place count 21 transition count 35
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t96 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 56 place count 19 transition count 33
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 7 with 2 rules applied. Total rules applied 58 place count 18 transition count 32
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 36 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 11 rules applied. Total rules applied 69 place count 17 transition count 22
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 73 place count 15 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 77 place count 13 transition count 18
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 79 place count 13 transition count 16
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 80 place count 12 transition count 15
Iterating global reduction 10 with 1 rules applied. Total rules applied 81 place count 12 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 82 place count 12 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 83 place count 11 transition count 13
Applied a total of 83 rules in 27 ms. Remains 11 /64 variables (removed 53) and now considering 13/136 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 11/64 places, 13/136 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-04-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 7 stabilizing places and 9 stable transitions
FORMULA CO4-PT-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 48 transition count 110
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 48 transition count 110
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 40 place count 48 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 45 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 45 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 42 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 42 transition count 90
Applied a total of 52 rules in 6 ms. Remains 42 /64 variables (removed 22) and now considering 90/136 (removed 46) transitions.
[2024-06-02 22:49:36] [INFO ] Flow matrix only has 77 transitions (discarded 13 similar events)
// Phase 1: matrix 77 rows 42 cols
[2024-06-02 22:49:36] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:49:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 22:49:36] [INFO ] Flow matrix only has 77 transitions (discarded 13 similar events)
[2024-06-02 22:49:36] [INFO ] Invariant cache hit.
[2024-06-02 22:49:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 22:49:36] [INFO ] Flow matrix only has 77 transitions (discarded 13 similar events)
[2024-06-02 22:49:36] [INFO ] Invariant cache hit.
[2024-06-02 22:49:36] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/64 places, 90/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 42/64 places, 90/136 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 228 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CO4-PT-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s17 1), p0:(NEQ s30 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 7 ms.
FORMULA CO4-PT-04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-04-LTLCardinality-03 finished in 594 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(F(p0)))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Graph (trivial) has 68 edges and 64 vertex of which 25 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 40 transition count 78
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 10 place count 33 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 17 place count 33 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 33 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 32 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 32 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 28 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 27 transition count 56
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 27 transition count 56
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 39 place count 27 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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 26 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 26 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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 25 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 25 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 45 place count 25 transition count 43
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 47 place count 24 transition count 43
Applied a total of 47 rules in 14 ms. Remains 24 /64 variables (removed 40) and now considering 43/136 (removed 93) transitions.
[2024-06-02 22:49:37] [INFO ] Flow matrix only has 32 transitions (discarded 11 similar events)
// Phase 1: matrix 32 rows 24 cols
[2024-06-02 22:49:37] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:49:37] [INFO ] Implicit Places using invariants in 23 ms returned [20, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/64 places, 43/136 transitions.
Graph (trivial) has 19 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 38/43 (removed 5) transitions.
[2024-06-02 22:49:37] [INFO ] Flow matrix only has 28 transitions (discarded 10 similar events)
// Phase 1: matrix 28 rows 20 cols
[2024-06-02 22:49:37] [INFO ] Computed 2 invariants in 3 ms
[2024-06-02 22:49:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:49:37] [INFO ] Flow matrix only has 28 transitions (discarded 10 similar events)
[2024-06-02 22:49:37] [INFO ] Invariant cache hit.
[2024-06-02 22:49:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:49:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/64 places, 38/136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 20/64 places, 38/136 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-04-LTLCardinality-04 finished in 182 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))||X(F(p2))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 51 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 51 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 51 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 49 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 49 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 48 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 48 transition count 102
Applied a total of 38 rules in 10 ms. Remains 48 /64 variables (removed 16) and now considering 102/136 (removed 34) transitions.
[2024-06-02 22:49:37] [INFO ] Flow matrix only has 85 transitions (discarded 17 similar events)
// Phase 1: matrix 85 rows 48 cols
[2024-06-02 22:49:37] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:49:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:49:37] [INFO ] Flow matrix only has 85 transitions (discarded 17 similar events)
[2024-06-02 22:49:37] [INFO ] Invariant cache hit.
[2024-06-02 22:49:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 22:49:37] [INFO ] Flow matrix only has 85 transitions (discarded 17 similar events)
[2024-06-02 22:49:37] [INFO ] Invariant cache hit.
[2024-06-02 22:49:37] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/64 places, 102/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 48/64 places, 102/136 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s20 1), p1:(OR (EQ s17 0) (EQ s4 1)), p2:(AND (EQ s25 0) (EQ s17 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-04-LTLCardinality-06 finished in 985 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)||X(X(X(G(p1))))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 49 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 49 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 49 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 46 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 46 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 44 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 44 transition count 96
Applied a total of 46 rules in 4 ms. Remains 44 /64 variables (removed 20) and now considering 96/136 (removed 40) transitions.
[2024-06-02 22:49:38] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
// Phase 1: matrix 81 rows 44 cols
[2024-06-02 22:49:38] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:49:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:49:38] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
[2024-06-02 22:49:38] [INFO ] Invariant cache hit.
[2024-06-02 22:49:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:38] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-06-02 22:49:38] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
[2024-06-02 22:49:38] [INFO ] Invariant cache hit.
[2024-06-02 22:49:38] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/64 places, 96/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 44/64 places, 96/136 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 5}]], initial=6, aps=[p1:(AND (NEQ s21 0) (NEQ s40 1)), p0:(AND (EQ s8 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-04-LTLCardinality-08 finished in 523 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 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 50 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 50 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 50 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 47 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 47 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 45 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 45 transition count 96
Applied a total of 45 rules in 7 ms. Remains 45 /64 variables (removed 19) and now considering 96/136 (removed 40) transitions.
[2024-06-02 22:49:38] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
// Phase 1: matrix 81 rows 45 cols
[2024-06-02 22:49:38] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:49:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 22:49:38] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
[2024-06-02 22:49:38] [INFO ] Invariant cache hit.
[2024-06-02 22:49:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-02 22:49:38] [INFO ] Flow matrix only has 81 transitions (discarded 15 similar events)
[2024-06-02 22:49:38] [INFO ] Invariant cache hit.
[2024-06-02 22:49:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/64 places, 96/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 45/64 places, 96/136 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s17 1) (AND (EQ s9 1) (OR (EQ s10 0) (EQ s32 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 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 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 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-04-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-04-LTLCardinality-10 finished in 541 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))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 48 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 48 transition count 109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 40 place count 48 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 44 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 44 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 41 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 41 transition count 87
Applied a total of 54 rules in 11 ms. Remains 41 /64 variables (removed 23) and now considering 87/136 (removed 49) transitions.
[2024-06-02 22:49:39] [INFO ] Flow matrix only has 76 transitions (discarded 11 similar events)
// Phase 1: matrix 76 rows 41 cols
[2024-06-02 22:49:39] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:49:39] [INFO ] Flow matrix only has 76 transitions (discarded 11 similar events)
[2024-06-02 22:49:39] [INFO ] Invariant cache hit.
[2024-06-02 22:49:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:49:39] [INFO ] Flow matrix only has 76 transitions (discarded 11 similar events)
[2024-06-02 22:49:39] [INFO ] Invariant cache hit.
[2024-06-02 22:49:39] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/64 places, 87/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 41/64 places, 87/136 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s32 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-04-LTLCardinality-13 finished in 245 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 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 136/136 transitions.
Graph (trivial) has 68 edges and 64 vertex of which 24 / 64 are part of one of the 3 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 42 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 40 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 13 place count 32 transition count 66
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 32 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 32 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 31 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 31 transition count 62
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 35 place count 26 transition count 56
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 25 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 25 transition count 54
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 46 place count 25 transition count 45
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 50 place count 23 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 23 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 3 with 2 rules applied. Total rules applied 53 place count 22 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 22 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 22 transition count 39
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 56 place count 21 transition count 39
Applied a total of 56 rules in 30 ms. Remains 21 /64 variables (removed 43) and now considering 39/136 (removed 97) transitions.
[2024-06-02 22:49:39] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
// Phase 1: matrix 27 rows 21 cols
[2024-06-02 22:49:39] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 22:49:39] [INFO ] Implicit Places using invariants in 57 ms returned [17, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/64 places, 39/136 transitions.
Graph (trivial) has 17 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 17 transition count 26
Graph (complete) has 43 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 11 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 11 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 11 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 11 transition count 18
Applied a total of 22 rules in 4 ms. Remains 11 /19 variables (removed 8) and now considering 18/39 (removed 21) transitions.
[2024-06-02 22:49:39] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-06-02 22:49:39] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:49:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:49:39] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2024-06-02 22:49:39] [INFO ] Invariant cache hit.
[2024-06-02 22:49:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/64 places, 18/136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 11/64 places, 18/136 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s1 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 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-04-LTLCardinality-14 finished in 194 ms.
All properties solved by simple procedures.
Total runtime 5234 ms.

BK_STOP 1717368580752

--------------------
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="CO4-PT-04"
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 CO4-PT-04, 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 r571-tall-171734910000017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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