Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978100380.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d0m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 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-d0m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679313823577

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:03:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:03:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:03:45] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-20 12:03:45] [INFO ] Transformed 262 places.
[2023-03-20 12:03:45] [INFO ] Transformed 73 transitions.
[2023-03-20 12:03:45] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 65 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 65 transition count 68
Applied a total of 12 rules in 16 ms. Remains 65 /72 variables (removed 7) and now considering 68/73 (removed 5) transitions.
// Phase 1: matrix 68 rows 65 cols
[2023-03-20 12:03:45] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-20 12:03:45] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 12:03:45] [INFO ] Invariant cache hit.
[2023-03-20 12:03:45] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 12:03:45] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-20 12:03:45] [INFO ] Invariant cache hit.
[2023-03-20 12:03:46] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/72 places, 68/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 65/72 places, 68/73 transitions.
Support contains 25 out of 65 places after structural reductions.
[2023-03-20 12:03:46] [INFO ] Flatten gal took : 23 ms
[2023-03-20 12:03:46] [INFO ] Flatten gal took : 8 ms
[2023-03-20 12:03:46] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1005 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10000 steps, including 1557 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1040 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 12:03:48] [INFO ] Invariant cache hit.
[2023-03-20 12:03:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:03:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:48] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-20 12:03:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:03:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:03:48] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-20 12:03:48] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 12:03:48] [INFO ] After 53ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-20 12:03:48] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-20 12:03:48] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 10 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Graph (complete) has 176 edges and 65 vertex of which 64 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 64 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 65
Applied a total of 5 rules in 12 ms. Remains 63 /65 variables (removed 2) and now considering 65/68 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 63/65 places, 65/68 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1046 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 573942 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{0=1, 1=1, 3=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 573942 steps, saw 297128 distinct states, run finished after 3005 ms. (steps per millisecond=190 ) properties seen :6
Running SMT prover for 2 properties.
// Phase 1: matrix 65 rows 63 cols
[2023-03-20 12:03:52] [INFO ] Computed 4 place invariants in 12 ms
[2023-03-20 12:03:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:03:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:52] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:03:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:03:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:03:52] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:03:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:03:52] [INFO ] After 13ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:03:52] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 12:03:52] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 65/65 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 63
Applied a total of 4 rules in 7 ms. Remains 61 /63 variables (removed 2) and now considering 63/65 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 61/63 places, 63/65 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1015 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 612344 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 612344 steps, saw 315046 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:03:56] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 12:03:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:03:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:56] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:03:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 12:03:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:56] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:03:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:03:56] [INFO ] After 16ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:03:56] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 12:03:56] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-20 12:03:56] [INFO ] Invariant cache hit.
[2023-03-20 12:03:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 12:03:56] [INFO ] Invariant cache hit.
[2023-03-20 12:03:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:03:56] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-20 12:03:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:03:56] [INFO ] Invariant cache hit.
[2023-03-20 12:03:56] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 61/61 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 59 transition count 60
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 5 place count 59 transition count 52
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 21 place count 51 transition count 52
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 27 place count 48 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 33 place count 45 transition count 49
Applied a total of 33 rules in 10 ms. Remains 45 /61 variables (removed 16) and now considering 49/63 (removed 14) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 49 rows 45 cols
[2023-03-20 12:03:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:03:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:03:56] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:56] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:03:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 12:03:56] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:56] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:03:56] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 12:03:56] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 200 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 14 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:03:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 12:03:57] [INFO ] Invariant cache hit.
[2023-03-20 12:03:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:03:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-20 12:03:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:03:57] [INFO ] Invariant cache hit.
[2023-03-20 12:03:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||F(p1)))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Applied a total of 10 rules in 6 ms. Remains 60 /65 variables (removed 5) and now considering 63/68 (removed 5) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-20 12:03:57] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:03:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 12:03:57] [INFO ] Invariant cache hit.
[2023-03-20 12:03:57] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:03:57] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-20 12:03:57] [INFO ] Invariant cache hit.
[2023-03-20 12:03:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 63/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 60/65 places, 63/68 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s21 1)), p0:(AND (GEQ s1 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 262 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X((G(p0)||(F((X(X(p0)) U p2))&&p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 6 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:03:58] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:03:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 12:03:58] [INFO ] Invariant cache hit.
[2023-03-20 12:03:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:03:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-20 12:03:58] [INFO ] Invariant cache hit.
[2023-03-20 12:03:58] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((!p0 U (p1||G(!p0))))&&(F(p3)||p2))))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Applied a total of 8 rules in 2 ms. Remains 61 /65 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-20 12:03:58] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:03:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:03:58] [INFO ] Invariant cache hit.
[2023-03-20 12:03:58] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:03:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-20 12:03:58] [INFO ] Invariant cache hit.
[2023-03-20 12:03:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 64/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 61/65 places, 64/68 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (AND (NOT p1) p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s22 1)), p3:(OR (AND (GEQ s6 1) (GEQ s19 1)) (LT s1 1) (LT s21 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s22 1))) (NOT (AND (GEQ s6 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37304 reset in 216 ms.
Product exploration explored 100000 steps with 37340 reset in 135 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p3), (X (NOT (AND (NOT p1) p0))), true]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), true]
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1020 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:03:59] [INFO ] Invariant cache hit.
[2023-03-20 12:03:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 12:03:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:59] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 12:03:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:03:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:03:59] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 12:03:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:03:59] [INFO ] After 15ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-20 12:03:59] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 12:03:59] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 342 steps, including 28 resets, run visited all 2 properties in 3 ms. (steps per millisecond=114 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p3), (X (NOT (AND (NOT p1) p0))), true, (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p3)), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 finished in 1551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Applied a total of 6 rules in 2 ms. Remains 62 /65 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-20 12:04:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:04:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 12:04:00] [INFO ] Invariant cache hit.
[2023-03-20 12:04:00] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 12:04:00] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-20 12:04:00] [INFO ] Invariant cache hit.
[2023-03-20 12:04:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 62/65 places, 65/68 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s1 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((!p0 U p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 9 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:04:00] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 12:04:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-20 12:04:00] [INFO ] Invariant cache hit.
[2023-03-20 12:04:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:04:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-20 12:04:00] [INFO ] Invariant cache hit.
[2023-03-20 12:04:00] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s57 1)), p1:(AND (GEQ s1 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 17 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:04:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:04:00] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:04:00] [INFO ] Invariant cache hit.
[2023-03-20 12:04:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:01] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-20 12:04:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:01] [INFO ] Invariant cache hit.
[2023-03-20 12:04:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22307 reset in 207 ms.
Product exploration explored 100000 steps with 22379 reset in 255 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:04:01] [INFO ] Invariant cache hit.
[2023-03-20 12:04:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 12:04:01] [INFO ] Invariant cache hit.
[2023-03-20 12:04:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-20 12:04:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:04:02] [INFO ] Invariant cache hit.
[2023-03-20 12:04:02] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22299 reset in 77 ms.
Product exploration explored 100000 steps with 22497 reset in 199 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:04:02] [INFO ] Invariant cache hit.
[2023-03-20 12:04:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:04:02] [INFO ] Invariant cache hit.
[2023-03-20 12:04:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:02] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-20 12:04:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:02] [INFO ] Invariant cache hit.
[2023-03-20 12:04:02] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 finished in 2169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 7 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
[2023-03-20 12:04:03] [INFO ] Invariant cache hit.
[2023-03-20 12:04:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:04:03] [INFO ] Invariant cache hit.
[2023-03-20 12:04:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:03] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-20 12:04:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:03] [INFO ] Invariant cache hit.
[2023-03-20 12:04:03] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22365 reset in 83 ms.
Product exploration explored 100000 steps with 22479 reset in 85 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 6 ms. (steps per millisecond=48 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 6 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:04:03] [INFO ] Invariant cache hit.
[2023-03-20 12:04:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 12:04:03] [INFO ] Invariant cache hit.
[2023-03-20 12:04:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-20 12:04:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:04:03] [INFO ] Invariant cache hit.
[2023-03-20 12:04:03] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 5 ms. (steps per millisecond=57 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 5 ms. (steps per millisecond=57 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22397 reset in 108 ms.
Product exploration explored 100000 steps with 22251 reset in 102 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:04:04] [INFO ] Invariant cache hit.
[2023-03-20 12:04:04] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:04:04] [INFO ] Invariant cache hit.
[2023-03-20 12:04:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:04] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-20 12:04:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:04:04] [INFO ] Invariant cache hit.
[2023-03-20 12:04:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 finished in 1779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p0)) U !p1)&&X(F(!p2)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Applied a total of 6 rules in 2 ms. Remains 62 /65 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-20 12:04:04] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 12:04:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 12:04:04] [INFO ] Invariant cache hit.
[2023-03-20 12:04:04] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 12:04:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-20 12:04:04] [INFO ] Invariant cache hit.
[2023-03-20 12:04:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 62/65 places, 65/68 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR p1 p2), p2, (OR p1 (AND (NOT p0) p2)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s41 1)), p2:(AND (GEQ s1 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 4 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:04:05] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:04:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 12:04:05] [INFO ] Invariant cache hit.
[2023-03-20 12:04:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-20 12:04:05] [INFO ] Invariant cache hit.
[2023-03-20 12:04:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 9 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:04:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:04:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 12:04:05] [INFO ] Invariant cache hit.
[2023-03-20 12:04:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:05] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-20 12:04:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:05] [INFO ] Invariant cache hit.
[2023-03-20 12:04:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s40 1)), p0:(OR (LT s8 1) (LT s40 1)), p2:(AND (GEQ s13 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22326 reset in 142 ms.
Product exploration explored 100000 steps with 22345 reset in 157 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 399 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1029 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1048 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1033 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1046 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 799018 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 799018 steps, saw 410384 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :4
Running SMT prover for 2 properties.
[2023-03-20 12:04:10] [INFO ] Invariant cache hit.
[2023-03-20 12:04:10] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 510 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:04:10] [INFO ] Invariant cache hit.
[2023-03-20 12:04:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:04:10] [INFO ] Invariant cache hit.
[2023-03-20 12:04:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:10] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-20 12:04:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:10] [INFO ] Invariant cache hit.
[2023-03-20 12:04:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2189 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 1032 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 5 ms. (steps per millisecond=57 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 6 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22261 reset in 83 ms.
Product exploration explored 100000 steps with 22315 reset in 92 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:04:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:04:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 12:04:11] [INFO ] Invariant cache hit.
[2023-03-20 12:04:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-20 12:04:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:11] [INFO ] Invariant cache hit.
[2023-03-20 12:04:11] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 59/60 places, 61/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 finished in 6227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 6 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:04:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:04:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:04:11] [INFO ] Invariant cache hit.
[2023-03-20 12:04:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:04:11] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-20 12:04:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:04:11] [INFO ] Invariant cache hit.
[2023-03-20 12:04:11] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s53 1)), p1:(AND (GEQ s1 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
[2023-03-20 12:04:12] [INFO ] Flatten gal took : 14 ms
[2023-03-20 12:04:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-20 12:04:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 68 transitions and 269 arcs took 3 ms.
Total runtime 27016 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1298/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1298/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1298/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14

BK_STOP 1679313852874

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
ltl formula formula --ltl=/tmp/1298/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 65 places, 68 transitions and 269 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
ltl formula formula --ltl=/tmp/1298/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 65 places, 68 transitions and 269 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1298/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1298/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1298/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1298/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
ltl formula formula --ltl=/tmp/1298/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 65 places, 68 transitions and 269 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1298/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1298/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1298/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1298/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5618254723f4]
1: pnml2lts-mc(+0xa2496) [0x561825472496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fdeac1fc140]
3: pnml2lts-mc(+0x405be5) [0x5618257d5be5]
4: pnml2lts-mc(+0x16b3f9) [0x56182553b3f9]
5: pnml2lts-mc(+0x164ac4) [0x561825534ac4]
6: pnml2lts-mc(+0x272e0a) [0x561825642e0a]
7: pnml2lts-mc(+0xb61f0) [0x5618254861f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fdeac04f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fdeac04f67a]
10: pnml2lts-mc(+0xa1581) [0x561825471581]
11: pnml2lts-mc(+0xa1910) [0x561825471910]
12: pnml2lts-mc(+0xa32a2) [0x5618254732a2]
13: pnml2lts-mc(+0xa50f4) [0x5618254750f4]
14: pnml2lts-mc(+0xa516b) [0x56182547516b]
15: pnml2lts-mc(+0x3f34b3) [0x5618257c34b3]
16: pnml2lts-mc(+0x7c63d) [0x56182544c63d]
17: pnml2lts-mc(+0x67d86) [0x561825437d86]
18: pnml2lts-mc(+0x60a8a) [0x561825430a8a]
19: pnml2lts-mc(+0x5eb15) [0x56182542eb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fdeac037d0a]
21: pnml2lts-mc(+0x6075e) [0x56182543075e]

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-d0m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d0m36, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978100380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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