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

About the Execution of LoLa+red for DatabaseWithMutex-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
383.947 11177.00 19086.00 376.10 FFFFFFFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 21K Feb 25 13:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 13:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 25 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 295K Feb 25 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Feb 25 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 248K Feb 25 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:22 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 DatabaseWithMutex-PT-04-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678314476157

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:27:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 22:27:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:27:57] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-08 22:27:57] [INFO ] Transformed 140 places.
[2023-03-08 22:27:57] [INFO ] Transformed 128 transitions.
[2023-03-08 22:27:57] [INFO ] Parsed PT model containing 140 places and 128 transitions and 416 arcs in 95 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.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 124 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-08 22:27:58] [INFO ] Computed 28 place invariants in 14 ms
[2023-03-08 22:27:58] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 22:27:58] [INFO ] Invariant cache hit.
[2023-03-08 22:27:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-08 22:27:58] [INFO ] Invariant cache hit.
[2023-03-08 22:27:58] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 124 out of 140 places after structural reductions.
[2023-03-08 22:27:58] [INFO ] Flatten gal took : 31 ms
[2023-03-08 22:27:58] [INFO ] Flatten gal took : 15 ms
[2023-03-08 22:27:58] [INFO ] Input system was already deterministic with 128 transitions.
Finished random walk after 887 steps, including 0 resets, run visited all 20 properties in 37 ms. (steps per millisecond=23 )
FORMULA DatabaseWithMutex-PT-04-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0 U (!p0 U X(X((X(p1)&&p1))))))) U p0))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 22:27:59] [INFO ] Invariant cache hit.
[2023-03-08 22:27:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 22:27:59] [INFO ] Invariant cache hit.
[2023-03-08 22:27:59] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 22:27:59] [INFO ] Invariant cache hit.
[2023-03-08 22:27:59] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 812 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p1), acceptance={} source=6 dest: 10}, { cond=p1, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 6}], [{ cond=(NOT p1), acceptance={} source=9 dest: 10}], [{ cond=p1, acceptance={} source=10 dest: 11}, { cond=(NOT p1), acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 12}], [{ cond=true, acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s14 1) (GEQ s44 1) (GEQ s86 1)) (AND (GEQ s13 1) (GEQ s42 1) (GEQ s86 1) (GEQ s107 1)) (AND (GEQ s55 1) (GEQ s74 1) (GEQ s95 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 5 reset in 4 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-00 finished in 1120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 112
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 112
Applied a total of 32 rules in 23 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
// Phase 1: matrix 112 rows 124 cols
[2023-03-08 22:28:00] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-08 22:28:00] [INFO ] Implicit Places using invariants in 75 ms returned [7, 13, 15, 23, 32, 39, 40, 46, 51, 61, 76, 88, 92, 103, 114, 122]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 77 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/140 places, 112/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 108/140 places, 112/128 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s26 1) (GEQ s93 1)) (AND (GEQ s40 1) (GEQ s72 1)) (AND (GEQ s30 1) (GEQ s75 1)) (AND (GEQ s2 1) (GEQ s17 1)) (AND (GEQ s90 1) (GEQ s93 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 311 ms.
Stack based approach found an accepted trace after 1186 steps with 0 reset with depth 1187 and stack size 1187 in 3 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-01 finished in 504 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((X(p1)&&p0))||X(G(p2))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-08 22:28:00] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-08 22:28:00] [INFO ] Implicit Places using invariants in 64 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 65 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (LT s56 1) (LT s29 1) (LT s30 1) (LT s4 1) (LT s34 1) (LT s63 1) (LT s121 1) (LT s10 1) (LT s101 1) (LT s70 1) (LT s43 1) (LT s16 1) (LT s74 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7566 reset in 333 ms.
Stack based approach found an accepted trace after 33721 steps with 2630 reset with depth 19 and stack size 19 in 103 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-02 finished in 699 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(((G(p1)&&p0) U (p2 U !p3)))))'
Support contains 84 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 22:28:01] [INFO ] Invariant cache hit.
[2023-03-08 22:28:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 22:28:01] [INFO ] Invariant cache hit.
[2023-03-08 22:28:01] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 22:28:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 22:28:01] [INFO ] Invariant cache hit.
[2023-03-08 22:28:01] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 264 ms :[p3, (AND (NOT p1) p3), p3, p3, (AND (NOT p1) p3)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) p2 (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p2 (NOT p1))), acceptance={0, 1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p1) (AND p2 p1)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p3 p2 p1), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p2 (NOT p1))), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p3 (NOT p2) p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=3 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p3 p2 p0 p1), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p2 (NOT p1))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={1} source=4 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p3 p2 p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(AND (LT s130 1) (LT s0 1) (LT s96 1) (LT s128 1) (LT s36 1) (LT s70 1) (LT s40 1) (LT s105 1) (LT s17 1) (LT s82 1) (LT s89 1) (LT s56 1) (LT s26 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6395 reset in 772 ms.
Stack based approach found an accepted trace after 19315 steps with 1219 reset with depth 19 and stack size 19 in 146 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-04 finished in 1432 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((G(p0)&&F((p1&&F(p2)))))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 22:28:02] [INFO ] Invariant cache hit.
[2023-03-08 22:28:02] [INFO ] Implicit Places using invariants in 61 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 62 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(OR (GEQ s89 1) (GEQ s117 1) (GEQ s8 1) (GEQ s91 1) (GEQ s38 1) (GEQ s69 1) (GEQ s68 1) (GEQ s13 1) (GEQ s99 1) (GEQ s45 1) (GEQ s19 1) (GEQ s48 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-05 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 22:28:03] [INFO ] Invariant cache hit.
[2023-03-08 22:28:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 22:28:03] [INFO ] Invariant cache hit.
[2023-03-08 22:28:03] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 22:28:03] [INFO ] Invariant cache hit.
[2023-03-08 22:28:03] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-07 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:(OR (AND (GEQ s32 1) (GEQ s120 1)) (AND (GEQ s52 1) (GEQ s92 1)) (AND (GEQ s37 1) (GEQ s97 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s117 1) (GEQ s120...], 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 30 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-07 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 140 transition count 100
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 55 rules applied. Total rules applied 83 place count 109 transition count 76
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 107 place count 85 transition count 76
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 107 place count 85 transition count 57
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 145 place count 66 transition count 57
Applied a total of 145 rules in 24 ms. Remains 66 /140 variables (removed 74) and now considering 57/128 (removed 71) transitions.
// Phase 1: matrix 57 rows 66 cols
[2023-03-08 22:28:03] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-08 22:28:03] [INFO ] Implicit Places using invariants in 68 ms returned [0, 2, 5, 6, 10, 11, 12, 13, 16, 17, 20, 23, 24, 30, 33, 37, 38, 39, 40, 43, 44, 45, 51, 55, 56, 57, 58, 64]
[2023-03-08 22:28:03] [INFO ] Actually due to overlaps returned [0, 11, 13, 24, 33, 37, 39, 40, 45, 55, 56, 58, 2, 5, 6, 10, 12, 16, 17, 20, 43, 44, 51, 64]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 70 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/140 places, 57/128 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 53
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 38 transition count 53
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 15 place count 31 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 22 place count 31 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 30 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 30 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 30 transition count 38
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 26 transition count 34
Applied a total of 36 rules in 6 ms. Remains 26 /42 variables (removed 16) and now considering 34/57 (removed 23) transitions.
// Phase 1: matrix 34 rows 26 cols
[2023-03-08 22:28:03] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-08 22:28:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 22:28:03] [INFO ] Invariant cache hit.
[2023-03-08 22:28:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/140 places, 34/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 26/140 places, 34/128 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s17 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]]
Product exploration explored 100000 steps with 4348 reset in 140 ms.
Stack based approach found an accepted trace after 18 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-08 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0)) U X(X(p2))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-08 22:28:03] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-08 22:28:03] [INFO ] Implicit Places using invariants in 89 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 90 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 11}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 9}, { cond=p1, acceptance={} source=7 dest: 10}], [{ cond=p0, acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 10}], [{ cond=(NOT p2), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 11}], [{ cond=(AND p1 p2), acceptance={0} source=11 dest: 1}, { cond=(NOT p1), acceptance={0} source=11 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=11 dest: 11}]], initial=4, aps=[p0:(OR (GEQ s46 1) (AND (GEQ s28 1) (GEQ s106 1))), p2:(AND (GEQ s28 1) (GEQ s106 1)), p1:(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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-09 finished in 580 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 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 140 transition count 97
Reduce places removed 34 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 58 rules applied. Total rules applied 89 place count 106 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 113 place count 82 transition count 73
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 113 place count 82 transition count 54
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 151 place count 63 transition count 54
Applied a total of 151 rules in 21 ms. Remains 63 /140 variables (removed 77) and now considering 54/128 (removed 74) transitions.
// Phase 1: matrix 54 rows 63 cols
[2023-03-08 22:28:04] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-08 22:28:04] [INFO ] Implicit Places using invariants in 66 ms returned [2, 5, 6, 7, 10, 12, 13, 14, 16, 17, 18, 21, 23, 24, 29, 36, 37, 39, 41, 43, 44, 45, 50, 53, 54, 56, 57, 61]
[2023-03-08 22:28:04] [INFO ] Actually due to overlaps returned [7, 12, 14, 16, 24, 36, 39, 41, 45, 53, 54, 57, 2, 5, 10, 13, 21, 23, 29, 37, 44, 50, 56, 61]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 68 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/140 places, 54/128 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 30 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 30 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 26 transition count 41
Applied a total of 26 rules in 5 ms. Remains 26 /39 variables (removed 13) and now considering 41/54 (removed 13) transitions.
// Phase 1: matrix 41 rows 26 cols
[2023-03-08 22:28:04] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-08 22:28:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 22:28:04] [INFO ] Invariant cache hit.
[2023-03-08 22:28:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/140 places, 41/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 26/140 places, 41/128 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2 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 0 reset in 126 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 86 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-10 finished in 423 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((X(p0)&&(p0||X((p1 U p2))))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-08 22:28:04] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-08 22:28:04] [INFO ] Implicit Places using invariants in 70 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s106 1)), p2:(AND (GEQ s28 1) (GEQ s106 1) (GEQ s2 1) (GEQ s18 1)), p1:(AND (GEQ s2 1) (GEQ s18 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1348 reset in 159 ms.
Stack based approach found an accepted trace after 1672 steps with 31 reset with depth 179 and stack size 179 in 3 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-11 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 96
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 68 rules applied. Total rules applied 100 place count 104 transition count 64
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 12 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2023-03-08 22:28:05] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-08 22:28:05] [INFO ] Implicit Places using invariants in 66 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2023-03-08 22:28:05] [INFO ] Actually due to overlaps returned [0, 6, 10, 12, 14, 20, 28, 31, 33, 34, 35, 38, 46, 47, 48, 50]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 68 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/140 places, 48/128 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 40 transition count 36
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 28 transition count 36
Applied a total of 24 rules in 10 ms. Remains 28 /40 variables (removed 12) and now considering 36/48 (removed 12) transitions.
// Phase 1: matrix 36 rows 28 cols
[2023-03-08 22:28:05] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-08 22:28:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 22:28:05] [INFO ] Invariant cache hit.
[2023-03-08 22:28:05] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/140 places, 36/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 28/140 places, 36/128 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s7 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]]
Product exploration explored 100000 steps with 24991 reset in 109 ms.
Stack based approach found an accepted trace after 11 steps with 3 reset with depth 2 and stack size 2 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-12 finished in 308 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)||G(p1))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 140 transition count 101
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 54 rules applied. Total rules applied 81 place count 110 transition count 77
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 105 place count 86 transition count 77
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 105 place count 86 transition count 58
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 143 place count 67 transition count 58
Applied a total of 143 rules in 12 ms. Remains 67 /140 variables (removed 73) and now considering 58/128 (removed 70) transitions.
// Phase 1: matrix 58 rows 67 cols
[2023-03-08 22:28:05] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-08 22:28:05] [INFO ] Implicit Places using invariants in 75 ms returned [0, 3, 5, 6, 7, 10, 14, 19, 20, 21, 24, 25, 26, 32, 35, 40, 43, 45, 46, 47, 48, 53, 57, 58, 59, 60, 61, 65]
[2023-03-08 22:28:05] [INFO ] Actually due to overlaps returned [0, 7, 19, 26, 35, 43, 45, 48, 57, 58, 59, 61, 3, 6, 10, 20, 21, 24, 25, 32, 40, 46, 60, 65]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 76 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/140 places, 58/128 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 39 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 35 transition count 50
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 35 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 31 transition count 46
Applied a total of 24 rules in 4 ms. Remains 31 /43 variables (removed 12) and now considering 46/58 (removed 12) transitions.
// Phase 1: matrix 46 rows 31 cols
[2023-03-08 22:28:05] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-08 22:28:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 22:28:05] [INFO ] Invariant cache hit.
[2023-03-08 22:28:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/140 places, 46/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 31/140 places, 46/128 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s26 1)), p1:(LT s10 1)], nbAcceptance=2, 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 0 reset in 144 ms.
Stack based approach found an accepted trace after 238 steps with 0 reset with depth 239 and stack size 211 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-13 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 140 transition count 99
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 64 rules applied. Total rules applied 93 place count 107 transition count 68
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 125 place count 76 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 75 transition count 67
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 126 place count 75 transition count 52
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 156 place count 60 transition count 52
Applied a total of 156 rules in 10 ms. Remains 60 /140 variables (removed 80) and now considering 52/128 (removed 76) transitions.
// Phase 1: matrix 52 rows 60 cols
[2023-03-08 22:28:05] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-08 22:28:06] [INFO ] Implicit Places using invariants in 60 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 26, 29, 33, 34, 36, 37, 39, 41, 42, 47, 50, 51, 52, 53, 54, 58]
[2023-03-08 22:28:06] [INFO ] Actually due to overlaps returned [0, 6, 10, 12, 14, 20, 29, 33, 36, 37, 42, 50, 51, 52, 54, 4, 16, 58]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 62 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/140 places, 52/128 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 42 transition count 42
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 32 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 31 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 31 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 30 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 30 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 30 transition count 40
Applied a total of 26 rules in 4 ms. Remains 30 /42 variables (removed 12) and now considering 40/52 (removed 12) transitions.
// Phase 1: matrix 40 rows 30 cols
[2023-03-08 22:28:06] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 22:28:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 22:28:06] [INFO ] Invariant cache hit.
[2023-03-08 22:28:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/140 places, 40/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 30/140 places, 40/128 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s14 1), p1:(AND (GEQ s19 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8004 reset in 126 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-15 finished in 404 ms.
All properties solved by simple procedures.
Total runtime 8787 ms.
ITS solved all properties within timeout

BK_STOP 1678314487334

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="DatabaseWithMutex-PT-04"
export BK_EXAMINATION="LTLFireability"
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 DatabaseWithMutex-PT-04, 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 r103-tall-167814479101068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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