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.r395-smll-171683823900053.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 SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716924586827

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 19:29:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:29:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:29:50] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2024-05-28 19:29:50] [INFO ] Transformed 1295 places.
[2024-05-28 19:29:50] [INFO ] Transformed 749 transitions.
[2024-05-28 19:29:50] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 18 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 391
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 391
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 196 transition count 385
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 385 place count 166 transition count 355
Iterating global reduction 2 with 30 rules applied. Total rules applied 415 place count 166 transition count 355
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 432 place count 166 transition count 338
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 448 place count 150 transition count 320
Iterating global reduction 3 with 16 rules applied. Total rules applied 464 place count 150 transition count 320
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 516 place count 150 transition count 268
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 521 place count 145 transition count 260
Iterating global reduction 4 with 5 rules applied. Total rules applied 526 place count 145 transition count 260
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 531 place count 140 transition count 255
Iterating global reduction 4 with 5 rules applied. Total rules applied 536 place count 140 transition count 255
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 538 place count 138 transition count 253
Iterating global reduction 4 with 2 rules applied. Total rules applied 540 place count 138 transition count 253
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 541 place count 137 transition count 252
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 137 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 543 place count 136 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 544 place count 136 transition count 251
Applied a total of 544 rules in 250 ms. Remains 136 /259 variables (removed 123) and now considering 251/749 (removed 498) transitions.
// Phase 1: matrix 251 rows 136 cols
[2024-05-28 19:29:51] [INFO ] Computed 5 invariants in 37 ms
[2024-05-28 19:29:52] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-28 19:29:52] [INFO ] Invariant cache hit.
[2024-05-28 19:29:52] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-28 19:29:53] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2024-05-28 19:29:53] [INFO ] Invariant cache hit.
[2024-05-28 19:29:53] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/259 places, 251/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2233 ms. Remains : 136/259 places, 251/749 transitions.
Support contains 23 out of 136 places after structural reductions.
[2024-05-28 19:29:53] [INFO ] Flatten gal took : 75 ms
[2024-05-28 19:29:53] [INFO ] Flatten gal took : 44 ms
[2024-05-28 19:29:53] [INFO ] Input system was already deterministic with 251 transitions.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 1075 ms. (steps per millisecond=9 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 176914 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{0=1, 1=1, 5=1, 7=1, 8=1, 10=1, 11=1, 12=1, 13=1, 15=1, 16=1, 19=1, 20=1, 21=1, 23=1}
Probabilistic random walk after 176914 steps, saw 82922 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :15
Running SMT prover for 10 properties.
[2024-05-28 19:29:58] [INFO ] Invariant cache hit.
[2024-05-28 19:29:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 19:29:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-28 19:29:59] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:7
[2024-05-28 19:29:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:29:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 19:29:59] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2024-05-28 19:29:59] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-28 19:30:00] [INFO ] After 506ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :3 sat :7
[2024-05-28 19:30:00] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 10 ms to minimize.
[2024-05-28 19:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-28 19:30:00] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-28 19:30:01] [INFO ] After 1366ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 718 ms.
[2024-05-28 19:30:01] [INFO ] After 2598ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 400 ms.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 251/251 transitions.
Graph (complete) has 462 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 249
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 126 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 126 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 117 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 117 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 117 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 112 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 112 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 112 transition count 170
Applied a total of 54 rules in 68 ms. Remains 112 /136 variables (removed 24) and now considering 170/251 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 112/136 places, 170/251 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 302233 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302233 steps, saw 132231 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 170 rows 112 cols
[2024-05-28 19:30:06] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 19:30:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:30:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:30:06] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 19:30:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:30:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:30:07] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-28 19:30:07] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-28 19:30:07] [INFO ] After 349ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-28 19:30:07] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 3 ms to minimize.
[2024-05-28 19:30:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-28 19:30:07] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 287 ms.
[2024-05-28 19:30:08] [INFO ] After 1380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 275 ms.
Support contains 11 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 170/170 transitions.
Applied a total of 0 rules in 29 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 112/112 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 170/170 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-28 19:30:08] [INFO ] Invariant cache hit.
[2024-05-28 19:30:08] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 19:30:08] [INFO ] Invariant cache hit.
[2024-05-28 19:30:08] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-28 19:30:08] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-28 19:30:08] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 19:30:08] [INFO ] Invariant cache hit.
[2024-05-28 19:30:09] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 714 ms. Remains : 112/112 places, 170/170 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 107 transition count 164
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 107 transition count 151
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 94 transition count 151
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 83 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 82 transition count 139
Applied a total of 61 rules in 40 ms. Remains 82 /112 variables (removed 30) and now considering 139/170 (removed 31) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 139 rows 82 cols
[2024-05-28 19:30:09] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 19:30:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:30:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 19:30:09] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-28 19:30:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:30:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 19:30:09] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-28 19:30:09] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-28 19:30:09] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-28 19:30:10] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 47 stable transitions
Graph (complete) has 514 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(X(X(X(G(p2)))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 162
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 149
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 144
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 101 transition count 135
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 101 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 101 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 100 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 100 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 99 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 99 transition count 128
Applied a total of 84 rules in 28 ms. Remains 99 /136 variables (removed 37) and now considering 128/251 (removed 123) transitions.
// Phase 1: matrix 128 rows 99 cols
[2024-05-28 19:30:10] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 19:30:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 19:30:10] [INFO ] Invariant cache hit.
[2024-05-28 19:30:10] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:30:11] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-28 19:30:11] [INFO ] Invariant cache hit.
[2024-05-28 19:30:11] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/136 places, 128/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 99/136 places, 128/251 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 991 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 13}], [{ cond=true, acceptance={} source=8 dest: 1}], [{ cond=(NOT p1), acceptance={} source=9 dest: 6}], [{ cond=(NOT p1), acceptance={} source=10 dest: 8}], [{ cond=(NOT p1), acceptance={} source=11 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=14 dest: 12}]], initial=7, aps=[p2:(OR (LT s1 1) (LT s93 1)), p1:(AND (GEQ s1 1) (GEQ s94 1)), p0:(AND (GEQ s1 1) (GEQ s93 1) (GEQ s1 1) (GEQ s55 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, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22444 reset in 464 ms.
Product exploration explored 100000 steps with 22573 reset in 285 ms.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 327 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 156 ms. Reduced automaton from 15 states, 25 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2123141 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :{}
Probabilistic random walk after 2123141 steps, saw 943087 distinct states, run finished after 3001 ms. (steps per millisecond=707 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 19:30:16] [INFO ] Invariant cache hit.
[2024-05-28 19:30:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:30:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 19:30:16] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 19:30:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:30:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:30:16] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 19:30:16] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:30:16] [INFO ] After 26ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 19:30:16] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
[2024-05-28 19:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-28 19:30:16] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-28 19:30:16] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 290 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 96 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 96 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 94 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 94 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 90 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 90 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 88 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 88 transition count 104
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 86 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 86 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 86 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 84 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 83 transition count 96
Applied a total of 38 rules in 57 ms. Remains 83 /99 variables (removed 16) and now considering 96/128 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 83/99 places, 96/128 transitions.
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119915 steps, run visited all 1 properties in 1613 ms. (steps per millisecond=694 )
Probabilistic random walk after 1119915 steps, saw 497329 distinct states, run finished after 1616 ms. (steps per millisecond=693 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 8 factoid took 137 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-28 19:30:19] [INFO ] Invariant cache hit.
[2024-05-28 19:30:19] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 19:30:19] [INFO ] Invariant cache hit.
[2024-05-28 19:30:19] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:30:19] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-28 19:30:19] [INFO ] Invariant cache hit.
[2024-05-28 19:30:19] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 99/99 places, 128/128 transitions.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 327 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1792481 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :{}
Probabilistic random walk after 1792481 steps, saw 796442 distinct states, run finished after 3001 ms. (steps per millisecond=597 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 19:30:23] [INFO ] Invariant cache hit.
[2024-05-28 19:30:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:30:23] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:30:23] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 19:30:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:30:23] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 19:30:23] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 19:30:23] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:30:23] [INFO ] After 24ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 19:30:23] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:30:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-28 19:30:23] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-28 19:30:23] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 128/128 transitions.
Graph (complete) has 290 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 96 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 96 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 94 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 94 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 90 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 90 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 88 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 88 transition count 104
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 86 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 86 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 86 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 84 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 83 transition count 96
Applied a total of 38 rules in 27 ms. Remains 83 /99 variables (removed 16) and now considering 96/128 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 83/99 places, 96/128 transitions.
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119915 steps, run visited all 1 properties in 1766 ms. (steps per millisecond=634 )
Probabilistic random walk after 1119915 steps, saw 497329 distinct states, run finished after 1766 ms. (steps per millisecond=634 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22528 reset in 236 ms.
Product exploration explored 100000 steps with 22425 reset in 255 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 97 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 95 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 95 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 93 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 93 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 93 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 91 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 89 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 84 transition count 98
Applied a total of 35 rules in 38 ms. Remains 84 /99 variables (removed 15) and now considering 98/128 (removed 30) transitions.
[2024-05-28 19:30:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 19:30:27] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 19:30:27] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/99 places, 98/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 84/99 places, 98/128 transitions.
Built C files in :
/tmp/ltsmin9375816187089103995
[2024-05-28 19:30:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9375816187089103995
Running compilation step : cd /tmp/ltsmin9375816187089103995;'/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 518 ms.
Running link step : cd /tmp/ltsmin9375816187089103995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin9375816187089103995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15600372974954750320.hoa' '--buchi-type=spotba'
LTSmin run took 1497 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 finished in 19388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 28 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 19:30:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:30:29] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 19:30:29] [INFO ] Invariant cache hit.
[2024-05-28 19:30:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 19:30:30] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-28 19:30:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 19:30:30] [INFO ] Invariant cache hit.
[2024-05-28 19:30:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 23 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
[2024-05-28 19:30:30] [INFO ] Invariant cache hit.
[2024-05-28 19:30:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 19:30:30] [INFO ] Invariant cache hit.
[2024-05-28 19:30:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 19:30:30] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-28 19:30:30] [INFO ] Invariant cache hit.
[2024-05-28 19:30:30] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 finished in 562 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((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 153
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 108 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 98 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 98 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 88 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 18 ms. Remains 87 /136 variables (removed 49) and now considering 102/251 (removed 149) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 19:30:30] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:30:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 19:30:30] [INFO ] Invariant cache hit.
[2024-05-28 19:30:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 19:30:31] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-28 19:30:31] [INFO ] Invariant cache hit.
[2024-05-28 19:30:31] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/136 places, 102/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 87/136 places, 102/251 transitions.
Stuttering acceptance computed with spot in 302 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22451 reset in 274 ms.
Product exploration explored 100000 steps with 22437 reset in 232 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 9 ms. (steps per millisecond=276 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 9 ms. (steps per millisecond=276 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 19:30:32] [INFO ] Invariant cache hit.
[2024-05-28 19:30:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 19:30:32] [INFO ] Invariant cache hit.
[2024-05-28 19:30:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 19:30:32] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-28 19:30:32] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 19:30:32] [INFO ] Invariant cache hit.
[2024-05-28 19:30:33] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 467 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22318 reset in 125 ms.
Product exploration explored 100000 steps with 22572 reset in 142 ms.
Built C files in :
/tmp/ltsmin1758732487930094840
[2024-05-28 19:30:33] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 19:30:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:30:33] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 19:30:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:30:33] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 19:30:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:30:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1758732487930094840
Running compilation step : cd /tmp/ltsmin1758732487930094840;'/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 438 ms.
Running link step : cd /tmp/ltsmin1758732487930094840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1758732487930094840;'/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/stateBased8096430193296086605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 19:30:49] [INFO ] Invariant cache hit.
[2024-05-28 19:30:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 19:30:49] [INFO ] Invariant cache hit.
[2024-05-28 19:30:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 19:30:49] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-28 19:30:49] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 19:30:49] [INFO ] Invariant cache hit.
[2024-05-28 19:30:49] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin8596028290667632369
[2024-05-28 19:30:49] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 19:30:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:30:49] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 19:30:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:30:49] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 19:30:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:30:49] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8596028290667632369
Running compilation step : cd /tmp/ltsmin8596028290667632369;'/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 515 ms.
Running link step : cd /tmp/ltsmin8596028290667632369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8596028290667632369;'/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/stateBased17715273809978812306.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 19:31:04] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:31:04] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:31:04] [INFO ] Time to serialize gal into /tmp/LTL1766029714358583673.gal : 4 ms
[2024-05-28 19:31:04] [INFO ] Time to serialize properties into /tmp/LTL1948179242770927703.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1766029714358583673.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7734266107140664173.hoa' '-atoms' '/tmp/LTL1948179242770927703.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1948179242770927703.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7734266107140664173.hoa
Detected timeout of ITS tools.
[2024-05-28 19:31:19] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:31:19] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:31:19] [INFO ] Time to serialize gal into /tmp/LTL17092135667388063603.gal : 4 ms
[2024-05-28 19:31:19] [INFO ] Time to serialize properties into /tmp/LTL7543151988371819942.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17092135667388063603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7543151988371819942.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((s1<1)||(l1191<1))")))||((F("((s1<1)||(l1191<1))"))&&(G(F("(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))))))))
Formula 0 simplified : XX(FG!"((s1<1)||(l1191<1))" & (G!"((s1<1)||(l1191<1))" | FG!"(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))
Detected timeout of ITS tools.
[2024-05-28 19:31:34] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:31:34] [INFO ] Applying decomposition
[2024-05-28 19:31:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1323352550104611189.txt' '-o' '/tmp/graph1323352550104611189.bin' '-w' '/tmp/graph1323352550104611189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1323352550104611189.bin' '-l' '-1' '-v' '-w' '/tmp/graph1323352550104611189.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:31:35] [INFO ] Decomposing Gal with order
[2024-05-28 19:31:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:31:35] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 19:31:35] [INFO ] Flatten gal took : 66 ms
[2024-05-28 19:31:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 10 ms.
[2024-05-28 19:31:35] [INFO ] Time to serialize gal into /tmp/LTL7842532679663056957.gal : 4 ms
[2024-05-28 19:31:35] [INFO ] Time to serialize properties into /tmp/LTL14885129744317392842.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7842532679663056957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14885129744317392842.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i0.u0.s1<1)||(u16.l1191<1))")))||((F("((i0.u0.s1<1)||(u16.l1191<1))"))&&(G(F("(((i0.u0.s1<1)||(i0.u0.l354<1))||((i0.u0....186
Formula 0 simplified : XX(FG!"((i0.u0.s1<1)||(u16.l1191<1))" & (G!"((i0.u0.s1<1)||(u16.l1191<1))" | FG!"(((i0.u0.s1<1)||(i0.u0.l354<1))||((i0.u0.s1<1)||(u1...170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2812607594210600730
[2024-05-28 19:31:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2812607594210600730
Running compilation step : cd /tmp/ltsmin2812607594210600730;'/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 365 ms.
Running link step : cd /tmp/ltsmin2812607594210600730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2812607594210600730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 94468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 120 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 120 transition count 142
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 105 transition count 127
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 105 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 105 transition count 120
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 79 place count 95 transition count 110
Iterating global reduction 1 with 10 rules applied. Total rules applied 89 place count 95 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 95 place count 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 93 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 93 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 91 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 90 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 89 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 97
Applied a total of 108 rules in 14 ms. Remains 89 /136 variables (removed 47) and now considering 97/251 (removed 154) transitions.
// Phase 1: matrix 97 rows 89 cols
[2024-05-28 19:32:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 19:32:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 19:32:05] [INFO ] Invariant cache hit.
[2024-05-28 19:32:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 19:32:05] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-28 19:32:05] [INFO ] Invariant cache hit.
[2024-05-28 19:32:05] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 97/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 89/136 places, 97/251 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s8 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(!p0 U (p1||G(!p0))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 96 transition count 120
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 96 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 96 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 94 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 92 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 91 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 91 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 89 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 89 transition count 106
Applied a total of 106 rules in 20 ms. Remains 89 /136 variables (removed 47) and now considering 106/251 (removed 145) transitions.
// Phase 1: matrix 106 rows 89 cols
[2024-05-28 19:32:06] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 19:32:06] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 19:32:06] [INFO ] Invariant cache hit.
[2024-05-28 19:32:06] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 19:32:06] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-28 19:32:06] [INFO ] Invariant cache hit.
[2024-05-28 19:32:06] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/136 places, 106/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 89/136 places, 106/251 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, false, false, (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s84 1))) (NOT (AND (GEQ s1 1) (GEQ s81 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 286 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 2018 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||X((F(p0) U p1))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 144
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 144
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 129
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 106 transition count 122
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 96 transition count 112
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 96 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 96 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 94 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 94 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 92 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 92 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 91 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 91 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 90 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 90 transition count 99
Applied a total of 106 rules in 7 ms. Remains 90 /136 variables (removed 46) and now considering 99/251 (removed 152) transitions.
// Phase 1: matrix 99 rows 90 cols
[2024-05-28 19:32:08] [INFO ] Computed 5 invariants in 9 ms
[2024-05-28 19:32:08] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 19:32:08] [INFO ] Invariant cache hit.
[2024-05-28 19:32:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 19:32:08] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-28 19:32:08] [INFO ] Invariant cache hit.
[2024-05-28 19:32:08] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/136 places, 99/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 90/136 places, 99/251 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U p1) U X((!p2||(p3 U p1))))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 169
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 169
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 156
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 151
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 101 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 101 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 101 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 99 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 99 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 97 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 96 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 96 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 95 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 94 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 94 transition count 128
Applied a total of 95 rules in 14 ms. Remains 94 /136 variables (removed 42) and now considering 128/251 (removed 123) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 19:32:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:32:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 19:32:08] [INFO ] Invariant cache hit.
[2024-05-28 19:32:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 19:32:09] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-05-28 19:32:09] [INFO ] Invariant cache hit.
[2024-05-28 19:32:09] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 128/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 94/136 places, 128/251 transitions.
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s78 1)), p2:(AND (GEQ s1 1) (GEQ s87 1)), p3:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 41639 reset in 296 ms.
Product exploration explored 100000 steps with 41774 reset in 406 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 183 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 366881 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{0=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 366881 steps, saw 167477 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :6
Running SMT prover for 4 properties.
[2024-05-28 19:32:15] [INFO ] Invariant cache hit.
[2024-05-28 19:32:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:32:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:32:15] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-28 19:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:32:15] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-28 19:32:15] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 19:32:15] [INFO ] After 90ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-28 19:32:16] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-28 19:32:16] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 126
Applied a total of 3 rules in 7 ms. Remains 93 /94 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/94 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 531461 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 531461 steps, saw 243034 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 126 rows 93 cols
[2024-05-28 19:32:19] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 19:32:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:19] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:32:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:20] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:20] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:32:20] [INFO ] After 197ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:20] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 221 ms.
[2024-05-28 19:32:20] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 98 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/93 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 19:32:20] [INFO ] Invariant cache hit.
[2024-05-28 19:32:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 19:32:20] [INFO ] Invariant cache hit.
[2024-05-28 19:32:21] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:32:21] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-28 19:32:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:32:21] [INFO ] Invariant cache hit.
[2024-05-28 19:32:21] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 93/93 places, 126/126 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 120
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 107
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 67 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 67 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 66 transition count 98
Applied a total of 55 rules in 16 ms. Remains 66 /93 variables (removed 27) and now considering 98/126 (removed 28) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 98 rows 66 cols
[2024-05-28 19:32:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:32:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:32:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 19:32:21] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:32:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:21] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:21] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-28 19:32:21] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (G (NOT (AND (NOT p1) p2 p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (AND (NOT p1) p3))]
Knowledge based reduction with 16 factoid took 327 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-28 19:32:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 19:32:23] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 19:32:23] [INFO ] Invariant cache hit.
[2024-05-28 19:32:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 19:32:23] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-28 19:32:23] [INFO ] Invariant cache hit.
[2024-05-28 19:32:23] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 94/94 places, 128/128 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 316 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 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 191 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 742380 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 742380 steps, saw 339022 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :3
Running SMT prover for 2 properties.
[2024-05-28 19:32:27] [INFO ] Invariant cache hit.
[2024-05-28 19:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 19:32:27] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 19:32:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 19:32:28] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:32:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-28 19:32:28] [INFO ] After 188ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 19:32:28] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-28 19:32:28] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 132 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 128/128 transitions.
Graph (complete) has 281 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 92 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 88 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 87 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 87 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 86 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 86 transition count 106
Applied a total of 22 rules in 24 ms. Remains 86 /94 variables (removed 8) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 86/94 places, 106/128 transitions.
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 769223 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 769223 steps, saw 346284 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 106 rows 86 cols
[2024-05-28 19:32:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:32:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 19:32:31] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:32:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:32] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:32:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 19:32:32] [INFO ] After 54ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 19:32:32] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-28 19:32:32] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 100 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-05-28 19:32:32] [INFO ] Invariant cache hit.
[2024-05-28 19:32:32] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-28 19:32:32] [INFO ] Invariant cache hit.
[2024-05-28 19:32:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 19:32:33] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-28 19:32:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:32:33] [INFO ] Invariant cache hit.
[2024-05-28 19:32:33] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 715 ms. Remains : 86/86 places, 106/106 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 86 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 100
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 81 transition count 86
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 67 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 62 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 61 transition count 80
Applied a total of 51 rules in 17 ms. Remains 61 /86 variables (removed 25) and now considering 80/106 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 80 rows 61 cols
[2024-05-28 19:32:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:32:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 19:32:33] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:32:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 19:32:33] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:32:33] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-28 19:32:33] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 8 factoid took 355 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 41665 reset in 397 ms.
Product exploration explored 100000 steps with 41627 reset in 375 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 128/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 108
Applied a total of 19 rules in 18 ms. Remains 87 /94 variables (removed 7) and now considering 108/128 (removed 20) transitions.
[2024-05-28 19:32:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 108 rows 87 cols
[2024-05-28 19:32:36] [INFO ] Computed 5 invariants in 12 ms
[2024-05-28 19:32:36] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/94 places, 108/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 87/94 places, 108/128 transitions.
Built C files in :
/tmp/ltsmin14677769515194438903
[2024-05-28 19:32:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14677769515194438903
Running compilation step : cd /tmp/ltsmin14677769515194438903;'/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 406 ms.
Running link step : cd /tmp/ltsmin14677769515194438903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14677769515194438903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11887192459683363823.hoa' '--buchi-type=spotba'
LTSmin run took 4260 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 32535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 151
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 151
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 106 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 106 transition count 130
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 95 transition count 119
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 95 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 89 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 87 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 85 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 84 transition count 98
Applied a total of 119 rules in 13 ms. Remains 84 /136 variables (removed 52) and now considering 98/251 (removed 153) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 19:32:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:32:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 19:32:41] [INFO ] Invariant cache hit.
[2024-05-28 19:32:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 19:32:41] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-28 19:32:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:32:41] [INFO ] Invariant cache hit.
[2024-05-28 19:32:41] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/136 places, 98/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 84/136 places, 98/251 transitions.
Stuttering acceptance computed with spot in 70 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22457 reset in 212 ms.
Product exploration explored 100000 steps with 22475 reset in 437 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[false]
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 81 ms. (steps per millisecond=445 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 81 ms. (steps per millisecond=445 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[false]
Stuttering acceptance computed with spot in 48 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 19:32:42] [INFO ] Invariant cache hit.
[2024-05-28 19:32:43] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 19:32:43] [INFO ] Invariant cache hit.
[2024-05-28 19:32:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 19:32:43] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-28 19:32:43] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 19:32:43] [INFO ] Invariant cache hit.
[2024-05-28 19:32:43] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[false]
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 56 ms. (steps per millisecond=645 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 56 ms. (steps per millisecond=645 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[false]
Stuttering acceptance computed with spot in 47 ms :[false]
Stuttering acceptance computed with spot in 47 ms :[false]
Product exploration explored 100000 steps with 22340 reset in 314 ms.
Product exploration explored 100000 steps with 22376 reset in 273 ms.
Built C files in :
/tmp/ltsmin7028285010255079981
[2024-05-28 19:32:44] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 19:32:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:32:44] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 19:32:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:32:44] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 19:32:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:32:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7028285010255079981
Running compilation step : cd /tmp/ltsmin7028285010255079981;'/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 316 ms.
Running link step : cd /tmp/ltsmin7028285010255079981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7028285010255079981;'/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/stateBased11171589919417254648.hoa' '--buchi-type=spotba'
LTSmin run took 286 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 4360 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&&((!p2 U (p3||G(!p2)))||p1)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 162
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 110 transition count 149
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 110 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 110 transition count 144
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 102 transition count 136
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 102 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 102 transition count 132
Applied a total of 77 rules in 17 ms. Remains 102 /136 variables (removed 34) and now considering 132/251 (removed 119) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 19:32:45] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 19:32:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-28 19:32:45] [INFO ] Invariant cache hit.
[2024-05-28 19:32:45] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:32:46] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-28 19:32:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:32:46] [INFO ] Invariant cache hit.
[2024-05-28 19:32:46] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/136 places, 132/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 920 ms. Remains : 102/136 places, 132/251 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p3 p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p3:(AND (NOT (AND (GEQ s1 1) (GEQ s97 1))) (NOT (AND (GEQ s1 1) (GEQ s96 1)))), p0:(OR (LT s1 1) (LT s87 1) (AND (OR (LT s1 1) (LT s96 1)) (OR (LT s1 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22408 reset in 222 ms.
Product exploration explored 100000 steps with 22488 reset in 411 ms.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 337 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (AND p3 p0)), (X (OR (AND p3 p0) (AND p1 p0))), (X (NOT (OR (AND (NOT p3) p2) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (X (AND p3 p0))), (X (X (OR (AND p3 p0) (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p3) p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 235 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 567488 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{3=1, 4=1, 5=1}
Probabilistic random walk after 567488 steps, saw 249593 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-28 19:32:51] [INFO ] Invariant cache hit.
[2024-05-28 19:32:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 19:32:51] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:32:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:32:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:51] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:51] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:32:51] [INFO ] After 176ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:51] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-28 19:32:52] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-28 19:32:52] [INFO ] After 761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 420 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 132/132 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 130
Applied a total of 3 rules in 7 ms. Remains 101 /102 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 101/102 places, 130/132 transitions.
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 422886 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422886 steps, saw 185738 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 130 rows 101 cols
[2024-05-28 19:32:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:32:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:32:56] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:56] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:32:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:56] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:56] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:56] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:32:56] [INFO ] After 158ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:56] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-28 19:32:56] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-28 19:32:56] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 277 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 10 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 101/101 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 19:32:57] [INFO ] Invariant cache hit.
[2024-05-28 19:32:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-28 19:32:57] [INFO ] Invariant cache hit.
[2024-05-28 19:32:57] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:32:57] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-05-28 19:32:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:32:57] [INFO ] Invariant cache hit.
[2024-05-28 19:32:57] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 101/101 places, 130/130 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 96 transition count 111
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 83 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 72 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 100
Applied a total of 60 rules in 16 ms. Remains 72 /101 variables (removed 29) and now considering 100/130 (removed 30) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 100 rows 72 cols
[2024-05-28 19:32:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:32:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:57] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:32:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:32:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:32:58] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:32:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-28 19:32:58] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-28 19:32:58] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (AND p3 p0)), (X (OR (AND p3 p0) (AND p1 p0))), (X (NOT (OR (AND (NOT p3) p2) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (X (AND p3 p0))), (X (X (OR (AND p3 p0) (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p3) p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (OR (NOT p0) (AND (NOT p3) p2))), (F (NOT (AND p0 p3))), (F (AND p0 (NOT p3) (NOT p2)))]
Knowledge based reduction with 13 factoid took 292 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 132/132 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 19:32:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:32:59] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-28 19:32:59] [INFO ] Invariant cache hit.
[2024-05-28 19:32:59] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:32:59] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-28 19:32:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:32:59] [INFO ] Invariant cache hit.
[2024-05-28 19:32:59] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 102/102 places, 132/132 transitions.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 337 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (AND p0 p3)), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 p3) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 p3) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 631368 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{3=1, 4=1, 5=1}
Probabilistic random walk after 631368 steps, saw 278261 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-28 19:33:04] [INFO ] Invariant cache hit.
[2024-05-28 19:33:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:04] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:04] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:33:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:04] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:33:04] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:33:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:33:04] [INFO ] After 197ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 19:33:04] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-28 19:33:04] [INFO ] After 388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-28 19:33:04] [INFO ] After 779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 336 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 132/132 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 130
Applied a total of 3 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 130/132 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/102 places, 130/132 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 624215 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 624215 steps, saw 274961 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 130 rows 101 cols
[2024-05-28 19:33:08] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 19:33:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:08] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:33:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:08] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:33:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:33:09] [INFO ] After 193ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 19:33:09] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 19:33:09] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-05-28 19:33:09] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 222 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 19:33:09] [INFO ] Invariant cache hit.
[2024-05-28 19:33:09] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 19:33:09] [INFO ] Invariant cache hit.
[2024-05-28 19:33:09] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 19:33:10] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-28 19:33:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:33:10] [INFO ] Invariant cache hit.
[2024-05-28 19:33:10] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 101/101 places, 130/130 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 101 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 96 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 96 transition count 111
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 83 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 72 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 100
Applied a total of 60 rules in 14 ms. Remains 72 /101 variables (removed 29) and now considering 100/130 (removed 30) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 100 rows 72 cols
[2024-05-28 19:33:10] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 19:33:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:10] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 19:33:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:10] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 19:33:10] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 19:33:11] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2024-05-28 19:33:11] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p3 p1 (NOT p2)), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (AND p0 p3)), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 p3) (AND p0 p1))), (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 p3) (AND p0 p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p1) p2)))))]
False Knowledge obtained : [(F (OR (NOT p0) (AND (NOT p3) p2))), (F (NOT (AND p0 p3))), (F (AND p0 (NOT p3) (NOT p2)))]
Knowledge based reduction with 13 factoid took 302 ms. Reduced automaton from 2 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Product exploration explored 100000 steps with 22488 reset in 387 ms.
Product exploration explored 100000 steps with 22438 reset in 404 ms.
Built C files in :
/tmp/ltsmin1427115741586050758
[2024-05-28 19:33:12] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-28 19:33:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:33:12] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-28 19:33:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:33:12] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-28 19:33:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:33:12] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1427115741586050758
Running compilation step : cd /tmp/ltsmin1427115741586050758;'/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 639 ms.
Running link step : cd /tmp/ltsmin1427115741586050758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1427115741586050758;'/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/stateBased10973089463751162437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 132/132 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 102 cols
[2024-05-28 19:33:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:33:27] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 19:33:27] [INFO ] Invariant cache hit.
[2024-05-28 19:33:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 19:33:28] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-28 19:33:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:33:28] [INFO ] Invariant cache hit.
[2024-05-28 19:33:28] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 582 ms. Remains : 102/102 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin15099650088362121866
[2024-05-28 19:33:28] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-05-28 19:33:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:33:28] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-05-28 19:33:28] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:33:28] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-05-28 19:33:28] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:33:28] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15099650088362121866
Running compilation step : cd /tmp/ltsmin15099650088362121866;'/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 651 ms.
Running link step : cd /tmp/ltsmin15099650088362121866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15099650088362121866;'/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/stateBased2940188733843055493.hoa' '--buchi-type=spotba'
LTSmin run took 6224 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 49971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(!p0&&G(!p1)))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 91 transition count 117
Applied a total of 101 rules in 20 ms. Remains 91 /136 variables (removed 45) and now considering 117/251 (removed 134) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 19:33:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:33:35] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 19:33:35] [INFO ] Invariant cache hit.
[2024-05-28 19:33:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 19:33:35] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-28 19:33:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:33:35] [INFO ] Invariant cache hit.
[2024-05-28 19:33:35] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/136 places, 117/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 91/136 places, 117/251 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22457 reset in 249 ms.
Product exploration explored 100000 steps with 22412 reset in 283 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 258 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 416232 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{0=1, 1=1, 3=1, 6=1}
Probabilistic random walk after 416232 steps, saw 179477 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :4
Running SMT prover for 3 properties.
[2024-05-28 19:33:41] [INFO ] Invariant cache hit.
[2024-05-28 19:33:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:41] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-28 19:33:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:41] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-28 19:33:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 19:33:41] [INFO ] After 74ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-28 19:33:41] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-28 19:33:41] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/91 places, 115/117 transitions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 519951 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 519951 steps, saw 223081 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 19:33:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:33:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:44] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:33:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:45] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:33:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 19:33:45] [INFO ] After 46ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 19:33:45] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-28 19:33:45] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 61 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 19:33:45] [INFO ] Invariant cache hit.
[2024-05-28 19:33:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 19:33:45] [INFO ] Invariant cache hit.
[2024-05-28 19:33:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 19:33:45] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-28 19:33:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:33:45] [INFO ] Invariant cache hit.
[2024-05-28 19:33:45] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 601 ms. Remains : 90/90 places, 115/115 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 12 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 19:33:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:33:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:46] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:33:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:33:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 19:33:46] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:33:46] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-28 19:33:46] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (OR p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 453 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 236 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 19:33:47] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 19:33:47] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 19:33:47] [INFO ] Invariant cache hit.
[2024-05-28 19:33:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 19:33:47] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-28 19:33:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:33:47] [INFO ] Invariant cache hit.
[2024-05-28 19:33:48] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 710 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 201 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 426565 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{0=1, 1=1, 3=1, 6=1}
Probabilistic random walk after 426565 steps, saw 184001 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :4
Running SMT prover for 3 properties.
[2024-05-28 19:33:52] [INFO ] Invariant cache hit.
[2024-05-28 19:33:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:33:52] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-28 19:33:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:33:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 19:33:52] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-28 19:33:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 19:33:52] [INFO ] After 79ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-28 19:33:52] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-28 19:33:53] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 178 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 5 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/91 places, 115/117 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 541320 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541320 steps, saw 231825 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 90 cols
[2024-05-28 19:33:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:33:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 19:33:56] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:56] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:33:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 19:33:56] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:57] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:33:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 19:33:57] [INFO ] After 70ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 19:33:57] [INFO ] After 142ms 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-05-28 19:33:57] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 19:33:57] [INFO ] Invariant cache hit.
[2024-05-28 19:33:57] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 19:33:57] [INFO ] Invariant cache hit.
[2024-05-28 19:33:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 19:33:57] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-28 19:33:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 19:33:57] [INFO ] Invariant cache hit.
[2024-05-28 19:33:58] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 669 ms. Remains : 90/90 places, 115/115 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 12 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2024-05-28 19:33:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 19:33:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:58] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 19:33:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 19:33:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 19:33:58] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 19:33:58] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-28 19:33:58] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (OR p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 464 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 214 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 219 ms :[(OR p0 p1), (OR p0 p1), p1, p1]
Product exploration explored 100000 steps with 22361 reset in 204 ms.
Product exploration explored 100000 steps with 22468 reset in 284 ms.
Built C files in :
/tmp/ltsmin16790130639177561115
[2024-05-28 19:34:00] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 19:34:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:00] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 19:34:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:00] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 19:34:00] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16790130639177561115
Running compilation step : cd /tmp/ltsmin16790130639177561115;'/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 577 ms.
Running link step : cd /tmp/ltsmin16790130639177561115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16790130639177561115;'/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/stateBased2154367162217083588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 19:34:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:34:15] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 19:34:15] [INFO ] Invariant cache hit.
[2024-05-28 19:34:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 19:34:15] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-28 19:34:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:34:15] [INFO ] Invariant cache hit.
[2024-05-28 19:34:15] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin15138135392628423593
[2024-05-28 19:34:15] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-28 19:34:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:15] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-28 19:34:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:15] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-28 19:34:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15138135392628423593
Running compilation step : cd /tmp/ltsmin15138135392628423593;'/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 590 ms.
Running link step : cd /tmp/ltsmin15138135392628423593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15138135392628423593;'/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/stateBased13741304532058152988.hoa' '--buchi-type=spotba'
LTSmin run took 12222 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 53268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !p1)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 160
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 108 transition count 141
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 131
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 96 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 92 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 92 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 90 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 89 transition count 112
Applied a total of 108 rules in 17 ms. Remains 89 /136 variables (removed 47) and now considering 112/251 (removed 139) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-28 19:34:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:34:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 19:34:28] [INFO ] Invariant cache hit.
[2024-05-28 19:34:28] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 19:34:29] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-28 19:34:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:34:29] [INFO ] Invariant cache hit.
[2024-05-28 19:34:29] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 112/251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 641 ms. Remains : 89/136 places, 112/251 transitions.
Stuttering acceptance computed with spot in 116 ms :[p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s83 1)), p0:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22414 reset in 245 ms.
Product exploration explored 100000 steps with 22348 reset in 266 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[p1, true, p1]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2076298 steps, run timeout after 3001 ms. (steps per millisecond=691 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2076298 steps, saw 845807 distinct states, run finished after 3007 ms. (steps per millisecond=690 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-28 19:34:33] [INFO ] Invariant cache hit.
[2024-05-28 19:34:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 19:34:33] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 19:34:33] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 finished in 5295 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((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Stuttering acceptance computed with spot in 329 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 122 transition count 153
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 122 transition count 153
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 108 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 108 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 108 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 98 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 98 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 92 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 90 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 90 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 88 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 87 transition count 102
Applied a total of 113 rules in 27 ms. Remains 87 /136 variables (removed 49) and now considering 102/251 (removed 149) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-05-28 19:34:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 19:34:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 19:34:34] [INFO ] Invariant cache hit.
[2024-05-28 19:34:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 19:34:34] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-28 19:34:34] [INFO ] Invariant cache hit.
[2024-05-28 19:34:35] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/136 places, 102/251 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 575 ms. Remains : 87/136 places, 102/251 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22539 reset in 204 ms.
Product exploration explored 100000 steps with 22508 reset in 212 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 10 ms. (steps per millisecond=248 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 11 ms. (steps per millisecond=226 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 19:34:36] [INFO ] Invariant cache hit.
[2024-05-28 19:34:36] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 19:34:36] [INFO ] Invariant cache hit.
[2024-05-28 19:34:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 19:34:36] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-28 19:34:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:34:36] [INFO ] Invariant cache hit.
[2024-05-28 19:34:36] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 623 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 9 ms. (steps per millisecond=276 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 10 ms. (steps per millisecond=248 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22506 reset in 201 ms.
Product exploration explored 100000 steps with 22377 reset in 219 ms.
Built C files in :
/tmp/ltsmin9472226329802301166
[2024-05-28 19:34:37] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 19:34:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:37] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 19:34:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:37] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 19:34:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9472226329802301166
Running compilation step : cd /tmp/ltsmin9472226329802301166;'/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 392 ms.
Running link step : cd /tmp/ltsmin9472226329802301166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9472226329802301166;'/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/stateBased10314107255449568007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-28 19:34:53] [INFO ] Invariant cache hit.
[2024-05-28 19:34:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 19:34:53] [INFO ] Invariant cache hit.
[2024-05-28 19:34:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 19:34:53] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-28 19:34:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 19:34:53] [INFO ] Invariant cache hit.
[2024-05-28 19:34:53] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin10030923743925690487
[2024-05-28 19:34:53] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-28 19:34:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:53] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-28 19:34:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:53] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-28 19:34:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:34:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10030923743925690487
Running compilation step : cd /tmp/ltsmin10030923743925690487;'/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 495 ms.
Running link step : cd /tmp/ltsmin10030923743925690487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10030923743925690487;'/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/stateBased2133057868757354835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 19:35:08] [INFO ] Flatten gal took : 24 ms
[2024-05-28 19:35:08] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:35:08] [INFO ] Time to serialize gal into /tmp/LTL9669879448645834902.gal : 3 ms
[2024-05-28 19:35:08] [INFO ] Time to serialize properties into /tmp/LTL13658426195790939866.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9669879448645834902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3268786124320298778.hoa' '-atoms' '/tmp/LTL13658426195790939866.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13658426195790939866.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3268786124320298778.hoa
Detected timeout of ITS tools.
[2024-05-28 19:35:23] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:35:23] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:35:23] [INFO ] Time to serialize gal into /tmp/LTL565557524882236344.gal : 3 ms
[2024-05-28 19:35:23] [INFO ] Time to serialize properties into /tmp/LTL3091961154915226112.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL565557524882236344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3091961154915226112.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((s1<1)||(l1191<1))")))||((F("((s1<1)||(l1191<1))"))&&(G(F("(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))))))))
Formula 0 simplified : XX(FG!"((s1<1)||(l1191<1))" & (G!"((s1<1)||(l1191<1))" | FG!"(((s1<1)||(l354<1))||((s1<1)||(l1191<1)))"))
Detected timeout of ITS tools.
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:35:38] [INFO ] Applying decomposition
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3008595006349527816.txt' '-o' '/tmp/graph3008595006349527816.bin' '-w' '/tmp/graph3008595006349527816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3008595006349527816.bin' '-l' '-1' '-v' '-w' '/tmp/graph3008595006349527816.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:35:38] [INFO ] Decomposing Gal with order
[2024-05-28 19:35:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:35:38] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-28 19:35:38] [INFO ] Flatten gal took : 17 ms
[2024-05-28 19:35:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 4 ms.
[2024-05-28 19:35:38] [INFO ] Time to serialize gal into /tmp/LTL110037973810501623.gal : 3 ms
[2024-05-28 19:35:38] [INFO ] Time to serialize properties into /tmp/LTL17232700368558728598.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL110037973810501623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17232700368558728598.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i7.u0.s1<1)||(i8.u18.l1191<1))")))||((F("((i7.u0.s1<1)||(i8.u18.l1191<1))"))&&(G(F("(((i7.u0.s1<1)||(i6.u11.l354<1))||(...196
Formula 0 simplified : XX(FG!"((i7.u0.s1<1)||(i8.u18.l1191<1))" & (G!"((i7.u0.s1<1)||(i8.u18.l1191<1))" | FG!"(((i7.u0.s1<1)||(i6.u11.l354<1))||((i7.u0.s1<...180
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6659413392405541873
[2024-05-28 19:35:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6659413392405541873
Running compilation step : cd /tmp/ltsmin6659413392405541873;'/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 284 ms.
Running link step : cd /tmp/ltsmin6659413392405541873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6659413392405541873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 95084 ms.
[2024-05-28 19:36:09] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2024-05-28 19:36:09] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin1852157701128065703
[2024-05-28 19:36:09] [INFO ] Computing symmetric may disable matrix : 251 transitions.
[2024-05-28 19:36:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:36:09] [INFO ] Computing symmetric may enable matrix : 251 transitions.
[2024-05-28 19:36:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:36:09] [INFO ] Computing Do-Not-Accords matrix : 251 transitions.
[2024-05-28 19:36:09] [INFO ] Flatten gal took : 48 ms
[2024-05-28 19:36:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:36:09] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1852157701128065703
Running compilation step : cd /tmp/ltsmin1852157701128065703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4031212013855829928.txt' '-o' '/tmp/graph4031212013855829928.bin' '-w' '/tmp/graph4031212013855829928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4031212013855829928.bin' '-l' '-1' '-v' '-w' '/tmp/graph4031212013855829928.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:36:09] [INFO ] Decomposing Gal with order
[2024-05-28 19:36:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:36:09] [INFO ] Removed a total of 163 redundant transitions.
[2024-05-28 19:36:09] [INFO ] Flatten gal took : 94 ms
[2024-05-28 19:36:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 15 ms.
[2024-05-28 19:36:09] [INFO ] Time to serialize gal into /tmp/LTLFireability16333864990606213728.gal : 7 ms
[2024-05-28 19:36:09] [INFO ] Time to serialize properties into /tmp/LTLFireability15630848830081842298.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16333864990606213728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15630848830081842298.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(!("((u0.s1>=1)&&(u0.l1191>=1))"))))||((F(!("((u0.s1>=1)&&(u0.l1191>=1))")))&&(G(F(!("(((u0.s1>=1)&&(i4.u18.l354>=1))&&((u0...189
Formula 0 simplified : XX(FG"((u0.s1>=1)&&(u0.l1191>=1))" & (G"((u0.s1>=1)&&(u0.l1191>=1))" | FG"(((u0.s1>=1)&&(i4.u18.l354>=1))&&((u0.s1>=1)&&(u0.l1191>=1...161
Compilation finished in 974 ms.
Running link step : cd /tmp/ltsmin1852157701128065703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1852157701128065703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: LTL layer: formula: X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.030: "X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.030: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.112: DFS-FIFO for weak LTL, using special progress label 254
pins2lts-mc-linux64( 0/ 8), 0.112: There are 255 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.112: State length is 137, there are 259 groups
pins2lts-mc-linux64( 0/ 8), 0.112: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.112: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.112: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.112: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.136: ~1 levels ~960 states ~1928 transitions
pins2lts-mc-linux64( 1/ 8), 0.144: ~1 levels ~1920 states ~3944 transitions
pins2lts-mc-linux64( 1/ 8), 0.169: ~1 levels ~3840 states ~8072 transitions
pins2lts-mc-linux64( 1/ 8), 0.236: ~1 levels ~7680 states ~17496 transitions
pins2lts-mc-linux64( 1/ 8), 0.379: ~1 levels ~15360 states ~33392 transitions
pins2lts-mc-linux64( 1/ 8), 1.146: ~1 levels ~30720 states ~66384 transitions
pins2lts-mc-linux64( 1/ 8), 3.129: ~1 levels ~61440 states ~134048 transitions
pins2lts-mc-linux64( 1/ 8), 4.101: ~1 levels ~122880 states ~268952 transitions
pins2lts-mc-linux64( 6/ 8), 5.972: ~5 levels ~245760 states ~569560 transitions
pins2lts-mc-linux64( 6/ 8), 8.307: ~6 levels ~491520 states ~1127784 transitions
pins2lts-mc-linux64( 6/ 8), 11.703: ~6 levels ~983040 states ~2235000 transitions
pins2lts-mc-linux64( 7/ 8), 17.439: ~6 levels ~1966080 states ~4830912 transitions
pins2lts-mc-linux64( 7/ 8), 28.634: ~7 levels ~3932160 states ~9462248 transitions
pins2lts-mc-linux64( 1/ 8), 51.479: ~7 levels ~7864320 states ~19605736 transitions
pins2lts-mc-linux64( 4/ 8), 96.081: ~8 levels ~15728640 states ~38846184 transitions
pins2lts-mc-linux64( 4/ 8), 184.970: ~9 levels ~31457280 states ~77137592 transitions
pins2lts-mc-linux64( 4/ 8), 364.033: ~10 levels ~62914560 states ~155768856 transitions
pins2lts-mc-linux64( 4/ 8), 735.867: ~10 levels ~125829120 states ~317901256 transitions
pins2lts-mc-linux64( 6/ 8), 760.754: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 760.858:
pins2lts-mc-linux64( 0/ 8), 760.858: mean standard work distribution: 0.6% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 760.858:
pins2lts-mc-linux64( 0/ 8), 760.858: Explored 126819478 states 324908965 transitions, fanout: 2.562
pins2lts-mc-linux64( 0/ 8), 760.858: Total exploration time 760.730 sec (760.620 sec minimum, 760.674 sec on average)
pins2lts-mc-linux64( 0/ 8), 760.858: States per second: 166708, Transitions per second: 427102
pins2lts-mc-linux64( 0/ 8), 760.858:
pins2lts-mc-linux64( 0/ 8), 760.858: Progress states detected: 133029499
pins2lts-mc-linux64( 0/ 8), 760.859: Redundant explorations: -5.5117
pins2lts-mc-linux64( 0/ 8), 760.859:
pins2lts-mc-linux64( 0/ 8), 760.859: Queue width: 8B, total height: 16010069, memory: 122.15MB
pins2lts-mc-linux64( 0/ 8), 760.859: Tree memory: 1032.0MB, 8.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 760.859: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 760.859: Stored 251 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 760.859: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 760.859: Est. total memory use: 1154.2MB (~1146.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1852157701128065703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1852157701128065703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&[](<>(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 19:58:18] [INFO ] Flatten gal took : 384 ms
[2024-05-28 19:58:18] [INFO ] Time to serialize gal into /tmp/LTLFireability1477050334031155082.gal : 106 ms
[2024-05-28 19:58:18] [INFO ] Time to serialize properties into /tmp/LTLFireability11987152045687449212.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1477050334031155082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11987152045687449212.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(!("((s1>=1)&&(l1191>=1))"))))||((F(!("((s1>=1)&&(l1191>=1))")))&&(G(F(!("(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))")))...161
Formula 0 simplified : XX(FG"((s1>=1)&&(l1191>=1))" & (G"((s1>=1)&&(l1191>=1))" | FG"(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))"))
Detected timeout of ITS tools.
[2024-05-28 20:20:27] [INFO ] Flatten gal took : 346 ms
[2024-05-28 20:20:29] [INFO ] Input system was already deterministic with 251 transitions.
[2024-05-28 20:20:29] [INFO ] Transformed 136 places.
[2024-05-28 20:20:29] [INFO ] Transformed 251 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 20:20:29] [INFO ] Time to serialize gal into /tmp/LTLFireability2817724947916206146.gal : 16 ms
[2024-05-28 20:20:29] [INFO ] Time to serialize properties into /tmp/LTLFireability1516445051070566163.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2817724947916206146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1516445051070566163.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G(F(!("((s1>=1)&&(l1191>=1))"))))||((F(!("((s1>=1)&&(l1191>=1))")))&&(G(F(!("(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))")))...161
Formula 0 simplified : XX(FG"((s1>=1)&&(l1191>=1))" & (G"((s1>=1)&&(l1191>=1))" | FG"(((s1>=1)&&(l354>=1))&&((s1>=1)&&(l1191>=1)))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12919084 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15676084 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="SieveSingleMsgMbox-PT-d1m64"
export BK_EXAMINATION="LTLFireability"
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 SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-smll-171683823900053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;