About the Execution of LoLa+red for SieveSingleMsgMbox-PT-d0m06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
284.636 | 8978.00 | 19013.00 | 85.50 | FFFTTTTFTFFFFFTT | 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.r423-tajo-167905976600363.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 lolaxred
Input is SieveSingleMsgMbox-PT-d0m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976600363
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.9K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:26 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-d0m06-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679246655562
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:24:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:24:17] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-19 17:24:17] [INFO ] Transformed 262 places.
[2023-03-19 17:24:17] [INFO ] Transformed 73 transitions.
[2023-03-19 17:24:17] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 65 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 64 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 64 transition count 67
Applied a total of 14 rules in 28 ms. Remains 64 /72 variables (removed 8) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 64 cols
[2023-03-19 17:24:17] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-19 17:24:17] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-19 17:24:17] [INFO ] Invariant cache hit.
[2023-03-19 17:24:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-19 17:24:17] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-19 17:24:17] [INFO ] Invariant cache hit.
[2023-03-19 17:24:18] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/72 places, 67/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 64/72 places, 67/73 transitions.
Support contains 9 out of 64 places after structural reductions.
[2023-03-19 17:24:18] [INFO ] Flatten gal took : 25 ms
[2023-03-19 17:24:18] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:24:18] [INFO ] Input system was already deterministic with 67 transitions.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 1055 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1005 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1011 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1005 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 17:24:19] [INFO ] Invariant cache hit.
[2023-03-19 17:24:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:24:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:24:19] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-19 17:24:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:24:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:24:19] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-19 17:24:19] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-19 17:24:19] [INFO ] After 23ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-19 17:24:19] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-19 17:24:20] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 67/67 transitions.
Graph (complete) has 174 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 61 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 61 transition count 63
Applied a total of 7 rules in 35 ms. Remains 61 /64 variables (removed 3) and now considering 63/67 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 61/64 places, 63/67 transitions.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1032 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1302 steps, run visited all 4 properties in 41 ms. (steps per millisecond=31 )
Probabilistic random walk after 1302 steps, saw 657 distinct states, run finished after 41 ms. (steps per millisecond=31 ) properties seen :4
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 197 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 60 transition count 62
Applied a total of 9 rules in 24 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-19 17:24:20] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-19 17:24:22] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2023-03-19 17:24:22] [INFO ] Invariant cache hit.
[2023-03-19 17:24:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:24:22] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2023-03-19 17:24:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:24:22] [INFO ] Invariant cache hit.
[2023-03-19 17:24:22] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1670 ms. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLCardinality-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:(GT 1 s41)], 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 76767 steps with 17194 reset in 301 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLCardinality-07 finished in 2203 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((p0&&G(p1))))))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 61 transition count 63
Applied a total of 7 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 61 cols
[2023-03-19 17:24:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:24:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-19 17:24:23] [INFO ] Invariant cache hit.
[2023-03-19 17:24:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:24:23] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 17:24:23] [INFO ] Invariant cache hit.
[2023-03-19 17:24:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 63/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 61/64 places, 63/67 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GT s50 0), p0:(GT 1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLCardinality-13 finished in 506 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(p0)))'
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Applied a total of 8 rules in 4 ms. Remains 60 /64 variables (removed 4) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-19 17:24:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:24:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 17:24:23] [INFO ] Invariant cache hit.
[2023-03-19 17:24:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:24:23] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-19 17:24:23] [INFO ] Invariant cache hit.
[2023-03-19 17:24:23] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 63/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 60/64 places, 63/67 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 194 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLCardinality-14 finished in 813 ms.
All properties solved by simple procedures.
Total runtime 6824 ms.
ITS solved all properties within timeout
BK_STOP 1679246664540
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-d0m06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d0m06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976600363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m06.tgz
mv SieveSingleMsgMbox-PT-d0m06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;