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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.2K 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 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 95K 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 160K 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-11-LTLCardinality-00
FORMULA_NAME MedleyA-PT-11-LTLCardinality-01
FORMULA_NAME MedleyA-PT-11-LTLCardinality-02
FORMULA_NAME MedleyA-PT-11-LTLCardinality-03
FORMULA_NAME MedleyA-PT-11-LTLCardinality-04
FORMULA_NAME MedleyA-PT-11-LTLCardinality-05
FORMULA_NAME MedleyA-PT-11-LTLCardinality-06
FORMULA_NAME MedleyA-PT-11-LTLCardinality-07
FORMULA_NAME MedleyA-PT-11-LTLCardinality-08
FORMULA_NAME MedleyA-PT-11-LTLCardinality-09
FORMULA_NAME MedleyA-PT-11-LTLCardinality-10
FORMULA_NAME MedleyA-PT-11-LTLCardinality-11
FORMULA_NAME MedleyA-PT-11-LTLCardinality-12
FORMULA_NAME MedleyA-PT-11-LTLCardinality-13
FORMULA_NAME MedleyA-PT-11-LTLCardinality-14
FORMULA_NAME MedleyA-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362323104

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-11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:05:25] [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:05:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:05:26] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-02 21:05:26] [INFO ] Transformed 150 places.
[2024-06-02 21:05:26] [INFO ] Transformed 478 transitions.
[2024-06-02 21:05:26] [INFO ] Found NUPN structural information;
[2024-06-02 21:05:26] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 258 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 4 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 119 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 119 transition count 423
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 111 transition count 378
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 111 transition count 378
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 110 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 110 transition count 374
Applied a total of 80 rules in 53 ms. Remains 110 /150 variables (removed 40) and now considering 374/469 (removed 95) transitions.
[2024-06-02 21:05:26] [INFO ] Flow matrix only has 302 transitions (discarded 72 similar events)
// Phase 1: matrix 302 rows 110 cols
[2024-06-02 21:05:26] [INFO ] Computed 23 invariants in 21 ms
[2024-06-02 21:05:26] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-02 21:05:26] [INFO ] Flow matrix only has 302 transitions (discarded 72 similar events)
[2024-06-02 21:05:26] [INFO ] Invariant cache hit.
[2024-06-02 21:05:27] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-06-02 21:05:27] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2024-06-02 21:05:27] [INFO ] Flow matrix only has 302 transitions (discarded 72 similar events)
[2024-06-02 21:05:27] [INFO ] Invariant cache hit.
[2024-06-02 21:05:27] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 108 transitions.
Found 108 dead transitions using SMT.
Drop transitions removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/150 places, 266/469 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 266
Applied a total of 2 rules in 5 ms. Remains 108 /110 variables (removed 2) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 108 cols
[2024-06-02 21:05:27] [INFO ] Computed 21 invariants in 4 ms
[2024-06-02 21:05:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 21:05:27] [INFO ] Invariant cache hit.
[2024-06-02 21:05:27] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-02 21:05:28] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/150 places, 266/469 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1542 ms. Remains : 108/150 places, 266/469 transitions.
Support contains 28 out of 108 places after structural reductions.
[2024-06-02 21:05:28] [INFO ] Flatten gal took : 75 ms
[2024-06-02 21:05:28] [INFO ] Flatten gal took : 33 ms
[2024-06-02 21:05:28] [INFO ] Input system was already deterministic with 266 transitions.
Support contains 26 out of 108 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 786 resets, run finished after 723 ms. (steps per millisecond=13 ) properties (out of 18) seen :7
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 137 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 21:05:29] [INFO ] Invariant cache hit.
[2024-06-02 21:05:30] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-02 21:05:30] [INFO ] [Real]Absence check using 13 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-02 21:05:30] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 21:05:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:30] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-02 21:05:30] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 21:05:30] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-02 21:05:30] [INFO ] After 229ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-06-02 21:05:31] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 7 ms to minimize.
[2024-06-02 21:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-02 21:05:31] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 21:05:31] [INFO ] After 792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-06-02 21:05:31] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 6 properties in 36 ms.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 266/266 transitions.
Graph (complete) has 509 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 265
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 98 transition count 244
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 98 transition count 244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 94 transition count 224
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 94 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 92 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 92 transition count 216
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 1 with 2 rules applied. Total rules applied 32 place count 91 transition count 215
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 87 transition count 238
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 87 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 86 transition count 235
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 86 transition count 398
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 104 place count 71 transition count 379
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 71 transition count 378
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 115 place count 71 transition count 378
Applied a total of 115 rules in 142 ms. Remains 71 /108 variables (removed 37) and now considering 378/266 (removed -112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 71/108 places, 378/266 transitions.
Incomplete random walk after 10000 steps, including 1674 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 305 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 378 rows 71 cols
[2024-06-02 21:05:31] [INFO ] Computed 20 invariants in 9 ms
[2024-06-02 21:05:31] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 21:05:31] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:05:32] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:05:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:32] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 21:05:32] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:05:32] [INFO ] State equation strengthened by 189 read => feed constraints.
[2024-06-02 21:05:32] [INFO ] After 57ms SMT Verify possible using 189 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:05:32] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-06-02 21:05:32] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 69 transition count 363
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 68 transition count 362
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 68 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 67 transition count 361
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 67 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 66 transition count 377
Applied a total of 10 rules in 51 ms. Remains 66 /71 variables (removed 5) and now considering 377/378 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 66/71 places, 377/378 transitions.
Finished random walk after 2479 steps, including 489 resets, run visited all 1 properties in 18 ms. (steps per millisecond=137 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 17 stabilizing places and 109 stable transitions
Graph (complete) has 651 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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((G(p1)&&X(F(p2))))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 266
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 99 transition count 249
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 99 transition count 249
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 96 transition count 233
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 96 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 94 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 94 transition count 225
Applied a total of 27 rules in 14 ms. Remains 94 /108 variables (removed 14) and now considering 225/266 (removed 41) transitions.
// Phase 1: matrix 225 rows 94 cols
[2024-06-02 21:05:32] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:05:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:05:32] [INFO ] Invariant cache hit.
[2024-06-02 21:05:33] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:05:33] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 21:05:33] [INFO ] Invariant cache hit.
[2024-06-02 21:05:33] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 225/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 94/108 places, 225/266 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 556 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 3}, { cond=(NOT p1), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(OR (EQ s81 0) (EQ s13 1)), p2:(AND (EQ s2 0) (EQ s24 1)), p0:(AND (EQ s67 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-01 finished in 1135 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&&(p0 U X(p0))))||G((p1&&F(p2)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 266
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 99 transition count 246
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 99 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 96 transition count 232
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 96 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 94 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 94 transition count 224
Applied a total of 27 rules in 16 ms. Remains 94 /108 variables (removed 14) and now considering 224/266 (removed 42) transitions.
// Phase 1: matrix 224 rows 94 cols
[2024-06-02 21:05:33] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:05:34] [INFO ] Invariant cache hit.
[2024-06-02 21:05:34] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-02 21:05:34] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-02 21:05:34] [INFO ] Invariant cache hit.
[2024-06-02 21:05:34] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 224/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 94/108 places, 224/266 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s22 1)), p1:(EQ s64 0), p2:(AND (EQ s22 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 931 ms.
Product exploration explored 100000 steps with 50000 reset in 855 ms.
Computed a total of 13 stabilizing places and 95 stable transitions
Graph (complete) has 542 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 95 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 296 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-11-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLCardinality-02 finished in 3095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F((X(p2)||p1)))||p0))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 266
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 98 transition count 244
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 98 transition count 244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 94 transition count 224
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 94 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 92 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 92 transition count 216
Applied a total of 31 rules in 9 ms. Remains 92 /108 variables (removed 16) and now considering 216/266 (removed 50) transitions.
// Phase 1: matrix 216 rows 92 cols
[2024-06-02 21:05:37] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:37] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:05:37] [INFO ] Invariant cache hit.
[2024-06-02 21:05:37] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:05:37] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-02 21:05:37] [INFO ] Invariant cache hit.
[2024-06-02 21:05:37] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/108 places, 216/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 92/108 places, 216/266 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(OR (EQ s82 0) (EQ s6 1)), p1:(OR (EQ s82 0) (EQ s6 1)), p2:(OR (EQ s52 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 508 ms.
Product exploration explored 100000 steps with 33333 reset in 505 ms.
Computed a total of 13 stabilizing places and 93 stable transitions
Graph (complete) has 527 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 93 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-11-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLCardinality-07 finished in 1824 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 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Graph (complete) has 651 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 96 transition count 242
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 96 transition count 242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 23 place count 92 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 92 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 90 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 90 transition count 214
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 37 place count 87 transition count 217
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 87 transition count 208
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 48 place count 86 transition count 207
Applied a total of 48 rules in 37 ms. Remains 86 /108 variables (removed 22) and now considering 207/266 (removed 59) transitions.
// Phase 1: matrix 207 rows 86 cols
[2024-06-02 21:05:38] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:38] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:05:38] [INFO ] Invariant cache hit.
[2024-06-02 21:05:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:05:39] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 21:05:39] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 21:05:39] [INFO ] Invariant cache hit.
[2024-06-02 21:05:39] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/108 places, 207/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 86/108 places, 207/266 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 0) (EQ s25 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 MedleyA-PT-11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-09 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U G(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 266
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 98 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 98 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 95 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 94 transition count 226
Applied a total of 27 rules in 8 ms. Remains 94 /108 variables (removed 14) and now considering 226/266 (removed 40) transitions.
// Phase 1: matrix 226 rows 94 cols
[2024-06-02 21:05:39] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 21:05:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:05:39] [INFO ] Invariant cache hit.
[2024-06-02 21:05:39] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:05:39] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 21:05:39] [INFO ] Invariant cache hit.
[2024-06-02 21:05:39] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 226/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 94/108 places, 226/266 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s28 0) (EQ s24 1)), p0:(OR (EQ s74 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 4 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-12 finished in 733 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)||(p1&&G(p2))))&&F(p2)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Graph (complete) has 651 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 places
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 97 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 97 transition count 243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 22 place count 94 transition count 228
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 93 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 93 transition count 224
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 29 place count 92 transition count 223
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
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 37 place count 88 transition count 248
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 51 place count 88 transition count 234
Applied a total of 51 rules in 43 ms. Remains 88 /108 variables (removed 20) and now considering 234/266 (removed 32) transitions.
// Phase 1: matrix 234 rows 88 cols
[2024-06-02 21:05:40] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:05:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:05:40] [INFO ] Invariant cache hit.
[2024-06-02 21:05:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-02 21:05:40] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 21:05:40] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 21:05:40] [INFO ] Invariant cache hit.
[2024-06-02 21:05:40] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/108 places, 234/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 594 ms. Remains : 88/108 places, 234/266 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s71 0), p2:(AND (EQ s4 0) (EQ s26 1)), p0:(OR (EQ s75 0) (EQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLCardinality-14 finished in 818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||G(p2)))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 266/266 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 266
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 99 transition count 251
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 99 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 96 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 96 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 232
Applied a total of 25 rules in 5 ms. Remains 95 /108 variables (removed 13) and now considering 232/266 (removed 34) transitions.
// Phase 1: matrix 232 rows 95 cols
[2024-06-02 21:05:40] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:05:41] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:05:41] [INFO ] Invariant cache hit.
[2024-06-02 21:05:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-02 21:05:41] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-02 21:05:41] [INFO ] Invariant cache hit.
[2024-06-02 21:05:41] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 232/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 95/108 places, 232/266 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s74 0) (EQ s3 1)), p0:(EQ s33 1), p2:(OR (EQ s76 0) (EQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7830 reset in 401 ms.
Product exploration explored 100000 steps with 7842 reset in 509 ms.
Computed a total of 12 stabilizing places and 97 stable transitions
Graph (complete) has 552 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 97 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 786 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 134 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 136 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-02 21:05:43] [INFO ] Invariant cache hit.
[2024-06-02 21:05:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 21:05:43] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:43] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 21:05:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 21:05:43] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:44] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 21:05:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-02 21:05:44] [INFO ] After 118ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 21:05:44] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-06-02 21:05:44] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 228 ms.
[2024-06-02 21:05:44] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 232/232 transitions.
Graph (complete) has 430 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 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 3 place count 93 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 88 transition count 261
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 35 place count 88 transition count 239
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 52 place count 88 transition count 387
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 85 place count 71 transition count 371
Applied a total of 85 rules in 30 ms. Remains 71 /95 variables (removed 24) and now considering 371/232 (removed -139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 71/95 places, 371/232 transitions.
Incomplete random walk after 10000 steps, including 1603 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 337 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 357 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 330 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 371 rows 71 cols
[2024-06-02 21:05:45] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:05:45] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:05:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:45] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:45] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:05:45] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-06-02 21:05:45] [INFO ] After 138ms SMT Verify possible using 191 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 21:05:45] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 300 ms.
[2024-06-02 21:05:46] [INFO ] After 850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 71 /71 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 71/71 places, 371/371 transitions.
Incomplete random walk after 10000 steps, including 1584 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 322 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:05:46] [INFO ] Invariant cache hit.
[2024-06-02 21:05:46] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:05:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:46] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:46] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:46] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-06-02 21:05:46] [INFO ] After 83ms SMT Verify possible using 191 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:46] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-06-02 21:05:46] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 71 /71 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 71/71 places, 371/371 transitions.
Incomplete random walk after 10000 steps, including 1559 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 336 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 561245 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561245 steps, saw 118018 distinct states, run finished after 3006 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:05:50] [INFO ] Invariant cache hit.
[2024-06-02 21:05:50] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:05:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 21:05:50] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:05:50] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:50] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-06-02 21:05:50] [INFO ] After 90ms SMT Verify possible using 191 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:50] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-06-02 21:05:50] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 371/371 transitions.
Applied a total of 0 rules in 23 ms. Remains 71 /71 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 71/71 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 71 /71 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-06-02 21:05:50] [INFO ] Invariant cache hit.
[2024-06-02 21:05:50] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 21:05:50] [INFO ] Invariant cache hit.
[2024-06-02 21:05:50] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-06-02 21:05:51] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-06-02 21:05:51] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 21:05:51] [INFO ] Invariant cache hit.
[2024-06-02 21:05:51] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 774 ms. Remains : 71/71 places, 371/371 transitions.
Graph (complete) has 435 edges and 71 vertex of which 65 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 65 transition count 346
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 1 with 2 rules applied. Total rules applied 28 place count 64 transition count 345
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 64 transition count 343
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 64 transition count 342
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 40 place count 63 transition count 334
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 52 place count 63 transition count 334
Applied a total of 52 rules in 21 ms. Remains 63 /71 variables (removed 8) and now considering 334/371 (removed 37) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 334 rows 63 cols
[2024-06-02 21:05:51] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 21:05:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:05:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-02 21:05:51] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:51] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:51] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-06-02 21:05:51] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 232/232 transitions.
Graph (complete) has 552 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 89 transition count 237
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 23 place count 89 transition count 223
Applied a total of 23 rules in 13 ms. Remains 89 /95 variables (removed 6) and now considering 223/232 (removed 9) transitions.
// Phase 1: matrix 223 rows 89 cols
[2024-06-02 21:05:52] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:52] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:05:52] [INFO ] Invariant cache hit.
[2024-06-02 21:05:52] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:05:52] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-02 21:05:52] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 21:05:52] [INFO ] Invariant cache hit.
[2024-06-02 21:05:53] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/95 places, 223/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 89/95 places, 223/232 transitions.
Computed a total of 10 stabilizing places and 95 stable transitions
Computed a total of 10 stabilizing places and 95 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 211 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 972 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 21:05:54] [INFO ] Invariant cache hit.
[2024-06-02 21:05:54] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 21:05:54] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:05:54] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 21:05:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:54] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:05:54] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 21:05:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:05:54] [INFO ] After 73ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 21:05:54] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-06-02 21:05:54] [INFO ] After 458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 19 times with reduction of 4 identical transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 89 transition count 382
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 49 place count 70 transition count 371
Applied a total of 49 rules in 17 ms. Remains 70 /89 variables (removed 19) and now considering 371/223 (removed -148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 70/89 places, 371/223 transitions.
Incomplete random walk after 10000 steps, including 1394 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 252 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 21:05:55] [INFO ] Flow matrix only has 359 transitions (discarded 12 similar events)
// Phase 1: matrix 359 rows 70 cols
[2024-06-02 21:05:55] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:55] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:05:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:55] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:55] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:05:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-02 21:05:55] [INFO ] After 76ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 21:05:55] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:05:55] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2024-06-02 21:05:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2024-06-02 21:05:55] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-06-02 21:05:55] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 7 ms.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 70 /70 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 70/70 places, 371/371 transitions.
Incomplete random walk after 10000 steps, including 1368 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 255 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1054628 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :{}
Probabilistic random walk after 1054628 steps, saw 203974 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:05:58] [INFO ] Flow matrix only has 359 transitions (discarded 12 similar events)
[2024-06-02 21:05:58] [INFO ] Invariant cache hit.
[2024-06-02 21:05:58] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:05:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:59] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:05:59] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:05:59] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-02 21:05:59] [INFO ] After 34ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:05:59] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-06-02 21:05:59] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 70 /70 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 70/70 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 371/371 transitions.
Applied a total of 0 rules in 7 ms. Remains 70 /70 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-06-02 21:05:59] [INFO ] Flow matrix only has 359 transitions (discarded 12 similar events)
[2024-06-02 21:05:59] [INFO ] Invariant cache hit.
[2024-06-02 21:05:59] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-02 21:05:59] [INFO ] Flow matrix only has 359 transitions (discarded 12 similar events)
[2024-06-02 21:05:59] [INFO ] Invariant cache hit.
[2024-06-02 21:05:59] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-02 21:05:59] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-06-02 21:05:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 21:05:59] [INFO ] Flow matrix only has 359 transitions (discarded 12 similar events)
[2024-06-02 21:05:59] [INFO ] Invariant cache hit.
[2024-06-02 21:06:00] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 763 ms. Remains : 70/70 places, 371/371 transitions.
Graph (complete) has 414 edges and 70 vertex of which 64 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 64 transition count 333
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 1 with 4 rules applied. Total rules applied 43 place count 62 transition count 331
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 62 transition count 330
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 62 transition count 329
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 61 transition count 325
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 62 place count 61 transition count 325
Applied a total of 62 rules in 21 ms. Remains 61 /70 variables (removed 9) and now considering 325/371 (removed 46) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 325 rows 61 cols
[2024-06-02 21:06:00] [INFO ] Computed 16 invariants in 3 ms
[2024-06-02 21:06:00] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:06:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-02 21:06:00] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:06:00] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:06:00] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-06-02 21:06:00] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 17 factoid took 533 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 9779 reset in 263 ms.
Product exploration explored 100000 steps with 9731 reset in 284 ms.
Built C files in :
/tmp/ltsmin15077881303180784380
[2024-06-02 21:06:02] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2024-06-02 21:06:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:06:02] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2024-06-02 21:06:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:06:02] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2024-06-02 21:06:02] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:06:02] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15077881303180784380
Running compilation step : cd /tmp/ltsmin15077881303180784380;'/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 1195 ms.
Running link step : cd /tmp/ltsmin15077881303180784380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin15077881303180784380;'/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/stateBased14814342075930162778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 89 cols
[2024-06-02 21:06:17] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:06:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:06:17] [INFO ] Invariant cache hit.
[2024-06-02 21:06:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:06:17] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 21:06:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:06:17] [INFO ] Invariant cache hit.
[2024-06-02 21:06:17] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 89/89 places, 223/223 transitions.
Built C files in :
/tmp/ltsmin17858827639190672554
[2024-06-02 21:06:17] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2024-06-02 21:06:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:06:17] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2024-06-02 21:06:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:06:17] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2024-06-02 21:06:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:06:17] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17858827639190672554
Running compilation step : cd /tmp/ltsmin17858827639190672554;'/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 781 ms.
Running link step : cd /tmp/ltsmin17858827639190672554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17858827639190672554;'/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/stateBased3578395193436286132.hoa' '--buchi-type=spotba'
LTSmin run took 13955 ms.
FORMULA MedleyA-PT-11-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-11-LTLCardinality-15 finished in 51746 ms.
All properties solved by simple procedures.
Total runtime 66757 ms.

BK_STOP 1717362393925

--------------------
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-11"
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-11, 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-171734926400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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