fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282600700
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d0m005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
265.252 11905.00 25094.00 145.00 TFFTFFTFTFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282600700.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d0m005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282600700
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 7 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 7 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 64K Jun 6 12:11 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 RingSingleMessageInMbox-PT-d0m005-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654925244724

Running Version 202205111006
[2022-06-11 05:27:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 05:27:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 05:27:26] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-06-11 05:27:26] [INFO ] Transformed 385 places.
[2022-06-11 05:27:26] [INFO ] Transformed 59 transitions.
[2022-06-11 05:27:26] [INFO ] Parsed PT model containing 385 places and 59 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 52 transition count 57
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 52 transition count 57
Applied a total of 6 rules in 15 ms. Remains 52 /56 variables (removed 4) and now considering 57/59 (removed 2) transitions.
// Phase 1: matrix 57 rows 52 cols
[2022-06-11 05:27:26] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-11 05:27:26] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 57 rows 52 cols
[2022-06-11 05:27:26] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 05:27:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 05:27:26] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 57 rows 52 cols
[2022-06-11 05:27:26] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 05:27:26] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 57/59 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/56 places, 57/59 transitions.
Support contains 27 out of 52 places after structural reductions.
[2022-06-11 05:27:26] [INFO ] Flatten gal took : 25 ms
[2022-06-11 05:27:26] [INFO ] Flatten gal took : 10 ms
[2022-06-11 05:27:26] [INFO ] Input system was already deterministic with 57 transitions.
Incomplete random walk after 10000 steps, including 2162 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 57 rows 52 cols
[2022-06-11 05:27:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 05:27:28] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 05:27:28] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:5
[2022-06-11 05:27:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 05:27:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 05:27:28] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2022-06-11 05:27:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 05:27:28] [INFO ] After 30ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :6 sat :5
[2022-06-11 05:27:28] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-11 05:27:28] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 52/52 places, 57/57 transitions.
Graph (complete) has 137 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 51 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 48 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 48 transition count 49
Applied a total of 10 rules in 11 ms. Remains 48 /52 variables (removed 4) and now considering 49/57 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/52 places, 49/57 transitions.
Incomplete random walk after 10000 steps, including 2161 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 49 rows 48 cols
[2022-06-11 05:27:29] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-11 05:27:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 05:27:29] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 05:27:29] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 05:27:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 05:27:29] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 05:27:29] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 05:27:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-11 05:27:29] [INFO ] After 18ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 05:27:29] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2022-06-11 05:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-06-11 05:27:29] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-11 05:27:29] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 49/49 transitions.
Incomplete random walk after 10000 steps, including 2192 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Probably explored full state space saw : 2520 states, properties seen :3
Probabilistic random walk after 6380 steps, saw 2520 distinct states, run finished after 27 ms. (steps per millisecond=236 ) properties seen :3
Explored full state space saw : 2520 states, properties seen :0
Exhaustive walk after 6380 steps, saw 2520 distinct states, run finished after 9 ms. (steps per millisecond=708 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 7 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||X(p1)))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 7 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:30] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-11 05:27:30] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-11 05:27:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (OR (AND (GEQ s1 1) (GEQ s38 1)) (AND (GEQ s1 1) (GEQ s35 1))) (GEQ s1 1) (GEQ s41 1)), p1:(OR (LT s1 1) (LT s35 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 53478 steps with 11508 reset in 163 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-01 finished in 664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 11 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-11 05:27:30] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-11 05:27:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-06-11 05:27:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s15 1) (OR (LT s2 1) (LT s21 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 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-02 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((true U G(p0))||G(F(p1))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 9 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:30] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:30] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-11 05:27:30] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-06-11 05:27:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s21 1)), p1:(OR (LT s6 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21879 reset in 123 ms.
Product exploration explored 100000 steps with 21755 reset in 129 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2161 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 05:27:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 05:27:31] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 47 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 : 47/47 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:32] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-11 05:27:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-06-11 05:27:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/47 places, 52/52 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Finished random walk after 39 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21820 reset in 177 ms.
Product exploration explored 100000 steps with 21757 reset in 109 ms.
Built C files in :
/tmp/ltsmin17614493271486469129
[2022-06-11 05:27:32] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-06-11 05:27:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 05:27:32] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-06-11 05:27:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 05:27:32] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-06-11 05:27:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 05:27:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17614493271486469129
Running compilation step : cd /tmp/ltsmin17614493271486469129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin17614493271486469129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17614493271486469129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10581493274258152149.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-03 finished in 2517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X((G(F((p1 U G(F(p0))))) U p1))&&F(p2))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 5 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:33] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:33] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-11 05:27:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s24 1)), p0:(AND (GEQ s1 1) (GEQ s31 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-04 finished in 585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))||X(X((false U p1)))||F(p2)))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 7 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:33] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-11 05:27:33] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-11 05:27:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s10 1) (GEQ s15 1)), p1:(AND (GEQ s1 1) (GEQ s45 1)), p0:(AND (GEQ s1 1) (GEQ s46 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-05 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 8 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:34] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:34] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-11 05:27:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-06-11 05:27:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-07 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 s9 1) (LT s15 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 21459 reset in 105 ms.
Product exploration explored 100000 steps with 21441 reset in 114 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2197 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 9072 steps, including 893 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1512 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:35] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-11 05:27:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-06-11 05:27:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2022-06-11 05:27:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/47 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2173 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 98 steps, run visited all 1 properties in 16 ms. (steps per millisecond=6 )
Probabilistic random walk after 98 steps, saw 58 distinct states, run finished after 16 ms. (steps per millisecond=6 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21591 reset in 99 ms.
Product exploration explored 100000 steps with 21514 reset in 117 ms.
Built C files in :
/tmp/ltsmin15684201689751589669
[2022-06-11 05:27:35] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2022-06-11 05:27:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 05:27:35] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2022-06-11 05:27:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 05:27:35] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2022-06-11 05:27:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 05:27:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15684201689751589669
Running compilation step : cd /tmp/ltsmin15684201689751589669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 127 ms.
Running link step : cd /tmp/ltsmin15684201689751589669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15684201689751589669;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2144920948505237265.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-07 finished in 1711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 4 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2022-06-11 05:27:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:36] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 49 rows 46 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-11 05:27:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 49 rows 46 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-09 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 s33 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 RingSingleMessageInMbox-PT-d0m005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-09 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 4 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:36] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-11 05:27:36] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 52 rows 47 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-11 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((true U p0)&&F(G(p0))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 13 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:36] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 49 rows 46 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-11 05:27:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-11 05:27:36] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-06-11 05:27:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 49 rows 46 cols
[2022-06-11 05:27:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-11 05:27:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m005-LTLFireability-14 finished in 186 ms.
All properties solved by simple procedures.
Total runtime 10717 ms.

BK_STOP 1654925256629

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="RingSingleMessageInMbox-PT-d0m005"
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-4028"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d0m005, 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 r312-tall-165472282600700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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