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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 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 1.1M 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-d2m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716944778950

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 01:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 01:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:06:22] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2024-05-29 01:06:22] [INFO ] Transformed 2398 places.
[2024-05-29 01:06:22] [INFO ] Transformed 1954 transitions.
[2024-05-29 01:06:23] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
Deduced a syphon composed of 1984 places in 35 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 969 place count 273 transition count 382
Iterating global reduction 1 with 116 rules applied. Total rules applied 1085 place count 273 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1093 place count 273 transition count 374
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1185 place count 181 transition count 282
Iterating global reduction 2 with 92 rules applied. Total rules applied 1277 place count 181 transition count 282
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1317 place count 181 transition count 242
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1355 place count 143 transition count 189
Iterating global reduction 3 with 38 rules applied. Total rules applied 1393 place count 143 transition count 189
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1416 place count 143 transition count 166
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1426 place count 133 transition count 151
Iterating global reduction 4 with 10 rules applied. Total rules applied 1436 place count 133 transition count 151
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1446 place count 123 transition count 141
Iterating global reduction 4 with 10 rules applied. Total rules applied 1456 place count 123 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1461 place count 118 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 1466 place count 118 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1468 place count 118 transition count 133
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1473 place count 113 transition count 128
Iterating global reduction 5 with 5 rules applied. Total rules applied 1478 place count 113 transition count 128
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1481 place count 110 transition count 125
Iterating global reduction 5 with 3 rules applied. Total rules applied 1484 place count 110 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1485 place count 109 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1486 place count 109 transition count 124
Applied a total of 1486 rules in 128 ms. Remains 109 /414 variables (removed 305) and now considering 124/1954 (removed 1830) transitions.
// Phase 1: matrix 124 rows 109 cols
[2024-05-29 01:06:23] [INFO ] Computed 5 invariants in 20 ms
[2024-05-29 01:06:23] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-29 01:06:23] [INFO ] Invariant cache hit.
[2024-05-29 01:06:24] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-29 01:06:24] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2024-05-29 01:06:24] [INFO ] Invariant cache hit.
[2024-05-29 01:06:24] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/414 places, 124/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1204 ms. Remains : 109/414 places, 124/1954 transitions.
Support contains 4 out of 109 places after structural reductions.
[2024-05-29 01:06:24] [INFO ] Flatten gal took : 76 ms
[2024-05-29 01:06:24] [INFO ] Flatten gal took : 30 ms
[2024-05-29 01:06:24] [INFO ] Input system was already deterministic with 124 transitions.
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 953 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 998 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 01:06:25] [INFO ] Invariant cache hit.
[2024-05-29 01:06:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 01:06:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-29 01:06:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 01:06:26] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 01:06:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-29 01:06:26] [INFO ] After 47ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 01:06:26] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 5 ms to minimize.
[2024-05-29 01:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-29 01:06:26] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-29 01:06:26] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 124/124 transitions.
Graph (complete) has 310 edges and 109 vertex of which 108 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 108 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 107 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 107 transition count 120
Applied a total of 6 rules in 23 ms. Remains 107 /109 variables (removed 2) and now considering 120/124 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 107/109 places, 120/124 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1019 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1082 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 511313 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{2=1}
Probabilistic random walk after 511313 steps, saw 239786 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 120 rows 107 cols
[2024-05-29 01:06:29] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 01:06:30] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 01:06:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 01:06:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-29 01:06:30] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 01:06:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:06:30] [INFO ] After 24ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 01:06:30] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 01:06:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-29 01:06:30] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 01:06:30] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 120/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 106 transition count 118
Applied a total of 3 rules in 13 ms. Remains 106 /107 variables (removed 1) and now considering 118/120 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 106/107 places, 118/120 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1004 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 630501 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 630501 steps, saw 295648 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 118 rows 106 cols
[2024-05-29 01:06:33] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 01:06:33] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 01:06:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 01:06:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 01:06:33] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 01:06:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:33] [INFO ] After 20ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 01:06:33] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:06:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-29 01:06:33] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-29 01:06:33] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-29 01:06:33] [INFO ] Invariant cache hit.
[2024-05-29 01:06:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 01:06:33] [INFO ] Invariant cache hit.
[2024-05-29 01:06:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:34] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-29 01:06:34] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 01:06:34] [INFO ] Invariant cache hit.
[2024-05-29 01:06:34] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 106/106 places, 118/118 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 100 transition count 110
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 14 place count 100 transition count 91
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 52 place count 81 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 78 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 77 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 77 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 76 transition count 95
Applied a total of 62 rules in 44 ms. Remains 76 /106 variables (removed 30) and now considering 95/118 (removed 23) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 95 rows 76 cols
[2024-05-29 01:06:34] [INFO ] Computed 6 invariants in 7 ms
[2024-05-29 01:06:34] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 01:06:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-29 01:06:34] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:06:34] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 01:06:34] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 01:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-29 01:06:34] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 01:06:34] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 348 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 124/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 105 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 104 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 104 transition count 116
Applied a total of 12 rules in 10 ms. Remains 104 /109 variables (removed 5) and now considering 116/124 (removed 8) transitions.
// Phase 1: matrix 116 rows 104 cols
[2024-05-29 01:06:34] [INFO ] Computed 5 invariants in 3 ms
[2024-05-29 01:06:35] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 01:06:35] [INFO ] Invariant cache hit.
[2024-05-29 01:06:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:35] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-05-29 01:06:35] [INFO ] Invariant cache hit.
[2024-05-29 01:06:35] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/109 places, 116/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 104/109 places, 116/124 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 320 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s44 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 660 ms.
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Computed a total of 28 stabilizing places and 35 stable transitions
Graph (complete) has 330 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 28 stabilizing places and 35 stable transitions
Detected a total of 28/104 stabilizing places and 35/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 finished in 2211 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 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 124/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 105 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 104 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 104 transition count 117
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 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 103 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 102 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 101 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 100 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 99 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 99 transition count 109
Applied a total of 22 rules in 11 ms. Remains 99 /109 variables (removed 10) and now considering 109/124 (removed 15) transitions.
// Phase 1: matrix 109 rows 99 cols
[2024-05-29 01:06:37] [INFO ] Computed 5 invariants in 4 ms
[2024-05-29 01:06:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 01:06:37] [INFO ] Invariant cache hit.
[2024-05-29 01:06:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-29 01:06:37] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-29 01:06:37] [INFO ] Invariant cache hit.
[2024-05-29 01:06:37] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 109/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 99/109 places, 109/124 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s77 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 383 ms.
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Computed a total of 23 stabilizing places and 28 stable transitions
Graph (complete) has 313 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 23 stabilizing places and 28 stable transitions
Detected a total of 23/99 stabilizing places and 28/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 finished in 1579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 124/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 106 transition count 119
Applied a total of 8 rules in 6 ms. Remains 106 /109 variables (removed 3) and now considering 119/124 (removed 5) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 01:06:38] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 01:06:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 01:06:38] [INFO ] Invariant cache hit.
[2024-05-29 01:06:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:06:39] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-29 01:06:39] [INFO ] Invariant cache hit.
[2024-05-29 01:06:39] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/109 places, 119/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 106/109 places, 119/124 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22531 reset in 296 ms.
Product exploration explored 100000 steps with 22599 reset in 249 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 274 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1058 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2037047 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :{}
Probabilistic random walk after 2037047 steps, saw 951145 distinct states, run finished after 3003 ms. (steps per millisecond=678 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:06:43] [INFO ] Invariant cache hit.
[2024-05-29 01:06:43] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:06:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 01:06:43] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 01:06:43] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:43] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:06:43] [INFO ] After 17ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:43] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:06:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-29 01:06:43] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 01:06:43] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 8 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1043 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1737106 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :{}
Probabilistic random walk after 1737106 steps, saw 811619 distinct states, run finished after 3001 ms. (steps per millisecond=578 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2024-05-29 01:06:46] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 01:06:46] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:06:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-29 01:06:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 01:06:47] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:47] [INFO ] After 22ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-05-29 01:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-29 01:06:47] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-29 01:06:47] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-29 01:06:47] [INFO ] Invariant cache hit.
[2024-05-29 01:06:47] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 01:06:47] [INFO ] Invariant cache hit.
[2024-05-29 01:06:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:47] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-29 01:06:47] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 01:06:47] [INFO ] Invariant cache hit.
[2024-05-29 01:06:47] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 22 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2024-05-29 01:06:47] [INFO ] Computed 6 invariants in 2 ms
[2024-05-29 01:06:47] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:06:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-29 01:06:47] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:06:47] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:48] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:06:48] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-29 01:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2024-05-29 01:06:48] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-29 01:06:48] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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 256 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 01:06:48] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 01:06:48] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 01:06:48] [INFO ] Invariant cache hit.
[2024-05-29 01:06:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:06:49] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-05-29 01:06:49] [INFO ] Invariant cache hit.
[2024-05-29 01:06:49] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 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 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1055 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1915328 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1915328 steps, saw 893013 distinct states, run finished after 3005 ms. (steps per millisecond=637 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:06:53] [INFO ] Invariant cache hit.
[2024-05-29 01:06:53] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:06:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 01:06:53] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 01:06:53] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:06:53] [INFO ] After 17ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 01:06:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 01:06:53] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 01:06:53] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2225 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 1111 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2128253 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{}
Probabilistic random walk after 2128253 steps, saw 993198 distinct states, run finished after 3001 ms. (steps per millisecond=709 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2024-05-29 01:06:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 01:06:56] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:06:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 01:06:56] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:06:56] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:56] [INFO ] After 13ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 01:06:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-29 01:06:56] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 01:06:56] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-29 01:06:56] [INFO ] Invariant cache hit.
[2024-05-29 01:06:56] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 01:06:56] [INFO ] Invariant cache hit.
[2024-05-29 01:06:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:06:57] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-29 01:06:57] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 01:06:57] [INFO ] Invariant cache hit.
[2024-05-29 01:06:57] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 18 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2024-05-29 01:06:57] [INFO ] Computed 6 invariants in 2 ms
[2024-05-29 01:06:57] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:06:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-29 01:06:57] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:06:57] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:06:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 01:06:57] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-29 01:06:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-29 01:06:57] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 01:06:57] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 262 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22497 reset in 202 ms.
Product exploration explored 100000 steps with 22465 reset in 217 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 26 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 01:06:59] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 01:06:59] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 01:06:59] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin16336091390975217110
[2024-05-29 01:06:59] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16336091390975217110
Running compilation step : cd /tmp/ltsmin16336091390975217110;'/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 710 ms.
Running link step : cd /tmp/ltsmin16336091390975217110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16336091390975217110;'/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/stateBased15056001591533693654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 01:07:14] [INFO ] Invariant cache hit.
[2024-05-29 01:07:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 01:07:14] [INFO ] Invariant cache hit.
[2024-05-29 01:07:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:07:15] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-29 01:07:15] [INFO ] Invariant cache hit.
[2024-05-29 01:07:15] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin4803945088541935972
[2024-05-29 01:07:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4803945088541935972
Running compilation step : cd /tmp/ltsmin4803945088541935972;'/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 489 ms.
Running link step : cd /tmp/ltsmin4803945088541935972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4803945088541935972;'/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/stateBased5161275884120535923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 01:07:30] [INFO ] Flatten gal took : 14 ms
[2024-05-29 01:07:30] [INFO ] Flatten gal took : 19 ms
[2024-05-29 01:07:30] [INFO ] Time to serialize gal into /tmp/LTL2614646756692152251.gal : 9 ms
[2024-05-29 01:07:30] [INFO ] Time to serialize properties into /tmp/LTL7836802976644094086.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/LTL2614646756692152251.gal' '-t' 'CGAL' '-hoa' '/tmp/aut69837800773490091.hoa' '-atoms' '/tmp/LTL7836802976644094086.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...315
Loading property file /tmp/LTL7836802976644094086.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut69837800773490091.hoa
Detected timeout of ITS tools.
[2024-05-29 01:07:45] [INFO ] Flatten gal took : 10 ms
[2024-05-29 01:07:45] [INFO ] Flatten gal took : 9 ms
[2024-05-29 01:07:45] [INFO ] Time to serialize gal into /tmp/LTL17175475504260072576.gal : 3 ms
[2024-05-29 01:07:45] [INFO ] Time to serialize properties into /tmp/LTL10282215920412455761.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/LTL17175475504260072576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10282215920412455761.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
Detected timeout of ITS tools.
[2024-05-29 01:08:00] [INFO ] Flatten gal took : 8 ms
[2024-05-29 01:08:00] [INFO ] Applying decomposition
[2024-05-29 01:08:00] [INFO ] Flatten gal took : 9 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/graph10696565380667766677.txt' '-o' '/tmp/graph10696565380667766677.bin' '-w' '/tmp/graph10696565380667766677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10696565380667766677.bin' '-l' '-1' '-v' '-w' '/tmp/graph10696565380667766677.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:08:00] [INFO ] Decomposing Gal with order
[2024-05-29 01:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:08:00] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-29 01:08:00] [INFO ] Flatten gal took : 57 ms
[2024-05-29 01:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 12 ms.
[2024-05-29 01:08:00] [INFO ] Time to serialize gal into /tmp/LTL8251779363419881377.gal : 5 ms
[2024-05-29 01:08:00] [INFO ] Time to serialize properties into /tmp/LTL10875569876054988655.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/LTL8251779363419881377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10875569876054988655.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(X(X(G("(i4.u6.l235<=0)")))))))
Formula 0 simplified : XXXXF!"(i4.u6.l235<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17366004295350387584
[2024-05-29 01:08:16] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17366004295350387584
Running compilation step : cd /tmp/ltsmin17366004295350387584;'/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 354 ms.
Running link step : cd /tmp/ltsmin17366004295350387584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17366004295350387584;'/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(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 112542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 124/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 105 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 104 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 104 transition count 117
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 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 103 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 102 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 101 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 100 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 99 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 99 transition count 109
Applied a total of 22 rules in 35 ms. Remains 99 /109 variables (removed 10) and now considering 109/124 (removed 15) transitions.
// Phase 1: matrix 109 rows 99 cols
[2024-05-29 01:08:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 01:08:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 01:08:31] [INFO ] Invariant cache hit.
[2024-05-29 01:08:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-29 01:08:31] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-29 01:08:31] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 01:08:31] [INFO ] Invariant cache hit.
[2024-05-29 01:08:31] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/109 places, 109/124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 483 ms. Remains : 99/109 places, 109/124 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 109/109 places, 124/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 106 transition count 119
Applied a total of 8 rules in 8 ms. Remains 106 /109 variables (removed 3) and now considering 119/124 (removed 5) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 01:08:31] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 01:08:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 01:08:32] [INFO ] Invariant cache hit.
[2024-05-29 01:08:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:08:32] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-29 01:08:32] [INFO ] Invariant cache hit.
[2024-05-29 01:08:32] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/109 places, 119/124 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 628 ms. Remains : 106/109 places, 119/124 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22345 reset in 212 ms.
Product exploration explored 100000 steps with 22486 reset in 218 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1509512 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :{}
Probabilistic random walk after 1509512 steps, saw 706157 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:08:36] [INFO ] Invariant cache hit.
[2024-05-29 01:08:36] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:08:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 01:08:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 01:08:36] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:08:36] [INFO ] After 27ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:36] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 01:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-29 01:08:36] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-29 01:08:36] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1061 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1904190 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :{}
Probabilistic random walk after 1904190 steps, saw 888191 distinct states, run finished after 3001 ms. (steps per millisecond=634 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2024-05-29 01:08:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 01:08:39] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:08:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 01:08:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:08:39] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:08:39] [INFO ] After 13ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:39] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 01:08:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 01:08:39] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 01:08:39] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-29 01:08:39] [INFO ] Invariant cache hit.
[2024-05-29 01:08:40] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 01:08:40] [INFO ] Invariant cache hit.
[2024-05-29 01:08:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:08:40] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-29 01:08:40] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 01:08:40] [INFO ] Invariant cache hit.
[2024-05-29 01:08:40] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 19 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2024-05-29 01:08:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-29 01:08:40] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:08:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-29 01:08:40] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:08:40] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:40] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 01:08:40] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-05-29 01:08:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2024-05-29 01:08:40] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 01:08:40] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 01:08:41] [INFO ] Computed 5 invariants in 3 ms
[2024-05-29 01:08:41] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 01:08:41] [INFO ] Invariant cache hit.
[2024-05-29 01:08:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:08:42] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-29 01:08:42] [INFO ] Invariant cache hit.
[2024-05-29 01:08:42] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 700 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 259 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1048 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1706426 steps, run timeout after 3001 ms. (steps per millisecond=568 ) properties seen :{}
Probabilistic random walk after 1706426 steps, saw 797373 distinct states, run finished after 3001 ms. (steps per millisecond=568 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 01:08:45] [INFO ] Invariant cache hit.
[2024-05-29 01:08:45] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:08:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 01:08:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 01:08:45] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:08:45] [INFO ] After 18ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:45] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 01:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-29 01:08:45] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 01:08:45] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 8 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2281 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 994 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2016269 steps, run timeout after 3001 ms. (steps per millisecond=671 ) properties seen :{}
Probabilistic random walk after 2016269 steps, saw 941327 distinct states, run finished after 3001 ms. (steps per millisecond=671 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2024-05-29 01:08:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 01:08:48] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:08:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-29 01:08:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 01:08:49] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:08:49] [INFO ] After 20ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:49] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 01:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-29 01:08:49] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 01:08:49] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-29 01:08:49] [INFO ] Invariant cache hit.
[2024-05-29 01:08:49] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 01:08:49] [INFO ] Invariant cache hit.
[2024-05-29 01:08:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 01:08:49] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-29 01:08:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 01:08:49] [INFO ] Invariant cache hit.
[2024-05-29 01:08:49] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 16 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2024-05-29 01:08:49] [INFO ] Computed 6 invariants in 2 ms
[2024-05-29 01:08:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:08:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-29 01:08:49] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 01:08:49] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:08:49] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:08:49] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-29 01:08:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-05-29 01:08:49] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 01:08:50] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 256 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22435 reset in 212 ms.
Product exploration explored 100000 steps with 22520 reset in 233 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 01:08:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 01:08:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 01:08:51] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin12996395688607646766
[2024-05-29 01:08:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12996395688607646766
Running compilation step : cd /tmp/ltsmin12996395688607646766;'/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 501 ms.
Running link step : cd /tmp/ltsmin12996395688607646766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12996395688607646766;'/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/stateBased1267214135701461337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 01:09:07] [INFO ] Invariant cache hit.
[2024-05-29 01:09:07] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 01:09:07] [INFO ] Invariant cache hit.
[2024-05-29 01:09:07] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 01:09:07] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-29 01:09:07] [INFO ] Invariant cache hit.
[2024-05-29 01:09:07] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin3903406289623149781
[2024-05-29 01:09:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3903406289623149781
Running compilation step : cd /tmp/ltsmin3903406289623149781;'/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 466 ms.
Running link step : cd /tmp/ltsmin3903406289623149781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3903406289623149781;'/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/stateBased5913693268399104810.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 01:09:22] [INFO ] Flatten gal took : 10 ms
[2024-05-29 01:09:22] [INFO ] Flatten gal took : 9 ms
[2024-05-29 01:09:22] [INFO ] Time to serialize gal into /tmp/LTL15103416316900973057.gal : 2 ms
[2024-05-29 01:09:22] [INFO ] Time to serialize properties into /tmp/LTL6000902585974936007.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/LTL15103416316900973057.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5202058781814174806.hoa' '-atoms' '/tmp/LTL6000902585974936007.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/LTL6000902585974936007.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5202058781814174806.hoa
Detected timeout of ITS tools.
[2024-05-29 01:09:37] [INFO ] Flatten gal took : 8 ms
[2024-05-29 01:09:37] [INFO ] Flatten gal took : 9 ms
[2024-05-29 01:09:37] [INFO ] Time to serialize gal into /tmp/LTL7847624711663569187.gal : 2 ms
[2024-05-29 01:09:37] [INFO ] Time to serialize properties into /tmp/LTL2070321709507545071.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/LTL7847624711663569187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2070321709507545071.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
Detected timeout of ITS tools.
[2024-05-29 01:09:52] [INFO ] Flatten gal took : 9 ms
[2024-05-29 01:09:52] [INFO ] Applying decomposition
[2024-05-29 01:09:52] [INFO ] Flatten gal took : 8 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/graph18047119270602896742.txt' '-o' '/tmp/graph18047119270602896742.bin' '-w' '/tmp/graph18047119270602896742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18047119270602896742.bin' '-l' '-1' '-v' '-w' '/tmp/graph18047119270602896742.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:09:53] [INFO ] Decomposing Gal with order
[2024-05-29 01:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:09:53] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-29 01:09:53] [INFO ] Flatten gal took : 18 ms
[2024-05-29 01:09:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 5 ms.
[2024-05-29 01:09:53] [INFO ] Time to serialize gal into /tmp/LTL380361202510320561.gal : 3 ms
[2024-05-29 01:09:53] [INFO ] Time to serialize properties into /tmp/LTL7927525415067532106.ltl : 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/LTL380361202510320561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7927525415067532106.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(i1.u6.l235<=0)")))))))
Formula 0 simplified : XXXXF!"(i1.u6.l235<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15780286731891587700
[2024-05-29 01:10:08] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15780286731891587700
Running compilation step : cd /tmp/ltsmin15780286731891587700;'/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 449 ms.
Running link step : cd /tmp/ltsmin15780286731891587700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15780286731891587700;'/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(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 111501 ms.
[2024-05-29 01:10:23] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6171465696909050036
[2024-05-29 01:10:23] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-29 01:10:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:10:23] [INFO ] Applying decomposition
[2024-05-29 01:10:23] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-29 01:10:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:10:23] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-29 01:10:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 01:10:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:10:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6171465696909050036
Running compilation step : cd /tmp/ltsmin6171465696909050036;'/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/graph11802955862494428712.txt' '-o' '/tmp/graph11802955862494428712.bin' '-w' '/tmp/graph11802955862494428712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11802955862494428712.bin' '-l' '-1' '-v' '-w' '/tmp/graph11802955862494428712.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:10:23] [INFO ] Decomposing Gal with order
[2024-05-29 01:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:10:23] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 01:10:23] [INFO ] Flatten gal took : 18 ms
[2024-05-29 01:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 10 ms.
[2024-05-29 01:10:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality12061463711554408294.gal : 2 ms
[2024-05-29 01:10:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality16511682704423897364.ltl : 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/LTLCardinality12061463711554408294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16511682704423897364.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(X(X(G("(i3.i0.u9.l235<=0)")))))))
Formula 0 simplified : XXXXF!"(i3.i0.u9.l235<=0)"
Compilation finished in 384 ms.
Running link step : cd /tmp/ltsmin6171465696909050036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6171465696909050036;'/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(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: LTL layer: formula: X(X(X(X([]((LTLAPp0==true))))))
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: "X(X(X(X([]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.091: DFS-FIFO for weak LTL, using special progress label 126
pins2lts-mc-linux64( 0/ 8), 0.091: There are 127 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.091: State length is 110, there are 131 groups
pins2lts-mc-linux64( 0/ 8), 0.091: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.091: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.091: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.091: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.128: ~1 levels ~960 states ~2128 transitions
pins2lts-mc-linux64( 6/ 8), 0.142: ~1 levels ~1920 states ~3920 transitions
pins2lts-mc-linux64( 6/ 8), 0.171: ~1 levels ~3840 states ~8648 transitions
pins2lts-mc-linux64( 6/ 8), 0.234: ~1 levels ~7680 states ~18280 transitions
pins2lts-mc-linux64( 6/ 8), 0.345: ~1 levels ~15360 states ~33528 transitions
pins2lts-mc-linux64( 6/ 8), 0.595: ~1 levels ~30720 states ~71584 transitions
pins2lts-mc-linux64( 6/ 8), 0.975: ~1 levels ~61440 states ~136032 transitions
pins2lts-mc-linux64( 0/ 8), 1.634: ~1 levels ~122880 states ~268848 transitions
pins2lts-mc-linux64( 0/ 8), 2.701: ~1 levels ~245760 states ~531760 transitions
pins2lts-mc-linux64( 0/ 8), 4.323: ~1 levels ~491520 states ~1085608 transitions
pins2lts-mc-linux64( 1/ 8), 6.281: ~1 levels ~983040 states ~2199960 transitions
pins2lts-mc-linux64( 1/ 8), 9.400: ~1 levels ~1966080 states ~4430176 transitions
pins2lts-mc-linux64( 0/ 8), 15.308: ~1 levels ~3932160 states ~8943040 transitions
pins2lts-mc-linux64( 7/ 8), 26.740: ~1 levels ~7864320 states ~17664272 transitions
pins2lts-mc-linux64( 7/ 8), 49.625: ~1 levels ~15728640 states ~35907448 transitions
pins2lts-mc-linux64( 0/ 8), 95.974: ~1 levels ~31457280 states ~71757064 transitions
pins2lts-mc-linux64( 4/ 8), 187.947: ~1 levels ~62914560 states ~143058840 transitions
pins2lts-mc-linux64( 7/ 8), 377.457: ~1 levels ~125829120 states ~289816872 transitions
pins2lts-mc-linux64( 5/ 8), 404.159: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 404.246:
pins2lts-mc-linux64( 0/ 8), 404.246: mean standard work distribution: 0.7% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 404.246:
pins2lts-mc-linux64( 0/ 8), 404.246: Explored 129535221 states 299647531 transitions, fanout: 2.313
pins2lts-mc-linux64( 0/ 8), 404.246: Total exploration time 404.150 sec (404.040 sec minimum, 404.078 sec on average)
pins2lts-mc-linux64( 0/ 8), 404.247: States per second: 320513, Transitions per second: 741426
pins2lts-mc-linux64( 0/ 8), 404.247:
pins2lts-mc-linux64( 0/ 8), 404.247: Progress states detected: 134217218
pins2lts-mc-linux64( 0/ 8), 404.247: Redundant explorations: -3.4884
pins2lts-mc-linux64( 0/ 8), 404.247:
pins2lts-mc-linux64( 0/ 8), 404.247: Queue width: 8B, total height: 10810891, memory: 82.48MB
pins2lts-mc-linux64( 0/ 8), 404.247: Tree memory: 1040.7MB, 8.1 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 404.247: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 404.247: Stored 125 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 404.247: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 404.247: Est. total memory use: 1123.2MB (~1106.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6171465696909050036;'/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(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6171465696909050036;'/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(X(X([]((LTLAPp0==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-29 01:31:43] [INFO ] Flatten gal took : 8 ms
[2024-05-29 01:31:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality10865746583965927650.gal : 1 ms
[2024-05-29 01:31:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality13879328058981851538.ltl : 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/LTLCardinality10865746583965927650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13879328058981851538.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...299
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t21, t22, t26, t27, t87, t94, t95, t96, t97, t98, t99, t100, t101, t103, t107, t109,...310
Computing Next relation with stutter on 4.85573e+17 deadlock states
Detected timeout of ITS tools.
[2024-05-29 01:53:03] [INFO ] Flatten gal took : 8 ms
[2024-05-29 01:53:03] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-29 01:53:03] [INFO ] Transformed 109 places.
[2024-05-29 01:53:03] [INFO ] Transformed 124 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-29 01:53:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality8959740721486828596.gal : 1 ms
[2024-05-29 01:53:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality4999756566680443897.ltl : 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/LTLCardinality8959740721486828596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4999756566680443897.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(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11910312 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16042040 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-smll-171683824000087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m96.tgz
mv SieveSingleMsgMbox-PT-d2m96 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;