fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r421-tajo-167905975100356
Last Updated
May 14, 2023

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
372.552 18471.00 33308.00 209.80 FFTFFTTTFFTFFTFT normal

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.r421-tajo-167905975100356.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 itstools
Input is SieveSingleMsgMbox-PT-d0m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975100356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:25 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-d0m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679176589883

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 21:56:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:56:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:56:31] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-18 21:56:31] [INFO ] Transformed 262 places.
[2023-03-18 21:56:31] [INFO ] Transformed 73 transitions.
[2023-03-18 21:56:31] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 67 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 67 transition count 70
Applied a total of 8 rules in 23 ms. Remains 67 /72 variables (removed 5) and now considering 70/73 (removed 3) transitions.
// Phase 1: matrix 70 rows 67 cols
[2023-03-18 21:56:31] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-18 21:56:32] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-18 21:56:32] [INFO ] Invariant cache hit.
[2023-03-18 21:56:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-18 21:56:32] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-18 21:56:32] [INFO ] Invariant cache hit.
[2023-03-18 21:56:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/72 places, 70/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 67/72 places, 70/73 transitions.
Support contains 28 out of 67 places after structural reductions.
[2023-03-18 21:56:32] [INFO ] Flatten gal took : 25 ms
[2023-03-18 21:56:32] [INFO ] Flatten gal took : 17 ms
[2023-03-18 21:56:32] [INFO ] Input system was already deterministic with 70 transitions.
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 156 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 155 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-18 21:56:33] [INFO ] Invariant cache hit.
[2023-03-18 21:56:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:56:33] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 21:56:33] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-18 21:56:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:56:33] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 21:56:33] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-18 21:56:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-18 21:56:33] [INFO ] After 102ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :6 sat :13
[2023-03-18 21:56:33] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :13
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-18 21:56:34] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :13
Fused 19 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 15 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 68
Applied a total of 4 rules in 10 ms. Remains 65 /67 variables (removed 2) and now considering 68/70 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 65/67 places, 68/70 transitions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1537 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1544 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1058 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Probably explored full state space saw : 702 states, properties seen :6
Probabilistic random walk after 1686 steps, saw 702 distinct states, run finished after 18 ms. (steps per millisecond=93 ) properties seen :6
Explored full state space saw : 702 states, properties seen :0
Exhaustive walk after 1686 steps, saw 702 distinct states, run finished after 9 ms. (steps per millisecond=187 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 205 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p1))&&F((G(p2)||G(p0))))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 8 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:56:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 21:56:35] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-18 21:56:35] [INFO ] Invariant cache hit.
[2023-03-18 21:56:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:56:35] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-18 21:56:35] [INFO ] Invariant cache hit.
[2023-03-18 21:56:35] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(AND (GEQ s1 1) (GEQ s42 1)), p2:(OR (LT s1 1) (LT s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 5 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 finished in 793 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(F((X(X(p0))&&F(p1)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Applied a total of 14 rules in 13 ms. Remains 60 /67 variables (removed 7) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-18 21:56:36] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 21:56:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-18 21:56:36] [INFO ] Invariant cache hit.
[2023-03-18 21:56:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 21:56:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-18 21:56:36] [INFO ] Invariant cache hit.
[2023-03-18 21:56:36] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 63/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 60/67 places, 63/70 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s28 1)), p0:(OR (LT s1 1) (LT s42 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28573 reset in 253 ms.
Product exploration explored 100000 steps with 28568 reset in 172 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 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 331 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:56:38] [INFO ] Invariant cache hit.
[2023-03-18 21:56:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 21:56:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 21:56:38] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 21:56:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:56:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 21:56:38] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 21:56:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 21:56:38] [INFO ] After 8ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-18 21:56:38] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 21:56:38] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 63/63 transitions.
Graph (complete) has 166 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 61
Applied a total of 3 rules in 17 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 59/60 places, 61/63 transitions.
Incomplete random walk after 10000 steps, including 2237 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 483 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 258 steps, run visited all 1 properties in 6 ms. (steps per millisecond=43 )
Probabilistic random walk after 258 steps, saw 138 distinct states, run finished after 6 ms. (steps per millisecond=43 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (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 LTL mode, iteration 0 : 60/60 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 21:56:39] [INFO ] Invariant cache hit.
[2023-03-18 21:56:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-18 21:56:39] [INFO ] Invariant cache hit.
[2023-03-18 21:56:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 21:56:39] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-18 21:56:39] [INFO ] Invariant cache hit.
[2023-03-18 21:56:39] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 60/60 places, 63/63 transitions.
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.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished Best-First random walk after 4557 steps, including 216 resets, run visited all 1 properties in 5 ms. (steps per millisecond=911 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28566 reset in 133 ms.
Product exploration explored 100000 steps with 28494 reset in 146 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 3 place count 59 transition count 61
Applied a total of 3 rules in 14 ms. Remains 59 /60 variables (removed 1) and now considering 61/63 (removed 2) transitions.
[2023-03-18 21:56:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:56:41] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-18 21:56:41] [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/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 59/60 places, 61/63 transitions.
Built C files in :
/tmp/ltsmin11277372014394509791
[2023-03-18 21:56:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11277372014394509791
Running compilation step : cd /tmp/ltsmin11277372014394509791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin11277372014394509791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11277372014394509791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1161464645269188135.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 finished in 5545 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((F(G(p1))&&p0))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 66
Applied a total of 8 rules in 4 ms. Remains 63 /67 variables (removed 4) and now considering 66/70 (removed 4) transitions.
// Phase 1: matrix 66 rows 63 cols
[2023-03-18 21:56:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 21:56:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 21:56:42] [INFO ] Invariant cache hit.
[2023-03-18 21:56:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-18 21:56:42] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-18 21:56:42] [INFO ] Invariant cache hit.
[2023-03-18 21:56:42] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 66/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 63/67 places, 66/70 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s28 1)), p1:(OR (LT s1 1) (LT s19 1) (LT s1 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 finished in 420 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((!p0 U X(!p0)))||(G(p2)&&p1))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 7 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 21:56:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 21:56:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 21:56:42] [INFO ] Invariant cache hit.
[2023-03-18 21:56:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:56:42] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-18 21:56:42] [INFO ] Invariant cache hit.
[2023-03-18 21:56:42] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 661 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p2) p0), p0, true, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 9}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 9}], [{ cond=(AND p2 p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 9}], [{ cond=p0, acceptance={} source=9 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(AND (GEQ s1 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28602 reset in 147 ms.
Product exploration explored 100000 steps with 28545 reset in 171 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 : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[p0, p0, p0, p0, p0, true]
Finished random walk after 21 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 380 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 263 ms :[p0, p0, p0, p0, p0, true]
Support contains 2 out of 59 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in 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-18 21:56:45] [INFO ] Invariant cache hit.
[2023-03-18 21:56:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 21:56:45] [INFO ] Invariant cache hit.
[2023-03-18 21:56:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:56:45] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-18 21:56:45] [INFO ] Invariant cache hit.
[2023-03-18 21:56:45] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, p0, p0, true]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 280 ms :[p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 28573 reset in 148 ms.
Product exploration explored 100000 steps with 28580 reset in 110 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 270 ms :[p0, p0, p0, p0, p0, true]
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 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 21:56:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 21:56:47] [INFO ] Invariant cache hit.
[2023-03-18 21:56:47] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin3365002421179074717
[2023-03-18 21:56:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3365002421179074717
Running compilation step : cd /tmp/ltsmin3365002421179074717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin3365002421179074717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3365002421179074717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14850418356898775791.hoa' '--buchi-type=spotba'
LTSmin run took 188 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 finished in 5317 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(X(F(p0))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 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 17 place count 59 transition count 61
Applied a total of 17 rules in 3 ms. Remains 59 /67 variables (removed 8) and now considering 61/70 (removed 9) transitions.
[2023-03-18 21:56:47] [INFO ] Invariant cache hit.
[2023-03-18 21:56:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 21:56:47] [INFO ] Invariant cache hit.
[2023-03-18 21:56:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 21:56:47] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-18 21:56:47] [INFO ] Invariant cache hit.
[2023-03-18 21:56:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/67 places, 61/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 59/67 places, 61/70 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s5 1) (GEQ s27 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 finished in 439 ms.
All properties solved by simple procedures.
Total runtime 16588 ms.

BK_STOP 1679176608354

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d0m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m04, 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 r421-tajo-167905975100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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