About the Execution of LoLa+red for DatabaseWithMutex-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2443.184 | 448600.00 | 482803.00 | 1588.10 | F?FTFFTFFFFFFFFF | 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-167814479101076.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479101076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 78K Feb 25 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 372K Feb 25 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 742K Feb 25 13:21 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 42K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 157K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 718K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 206K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K 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 840K 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-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678315666997
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-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:47:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 22:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:47:48] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-08 22:47:48] [INFO ] Transformed 830 places.
[2023-03-08 22:47:48] [INFO ] Transformed 800 transitions.
[2023-03-08 22:47:48] [INFO ] Found NUPN structural information;
[2023-03-08 22:47:48] [INFO ] Parsed PT model containing 830 places and 800 transitions and 3800 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-08 22:47:48] [INFO ] Reduced 90 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 830 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 22 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-08 22:47:49] [INFO ] Computed 130 place invariants in 51 ms
[2023-03-08 22:47:49] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-08 22:47:49] [INFO ] Invariant cache hit.
[2023-03-08 22:47:49] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2023-03-08 22:47:49] [INFO ] Invariant cache hit.
[2023-03-08 22:47:50] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1755 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2023-03-08 22:47:51] [INFO ] Flatten gal took : 129 ms
[2023-03-08 22:47:51] [INFO ] Flatten gal took : 80 ms
[2023-03-08 22:47:51] [INFO ] Input system was already deterministic with 800 transitions.
Finished random walk after 2029 steps, including 0 resets, run visited all 22 properties in 86 ms. (steps per millisecond=23 )
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((X(G(p0)) U (p1 U p0))))'
Support contains 300 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 46 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 22:47:52] [INFO ] Invariant cache hit.
[2023-03-08 22:47:52] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-08 22:47:52] [INFO ] Invariant cache hit.
[2023-03-08 22:47:53] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2023-03-08 22:47:53] [INFO ] Invariant cache hit.
[2023-03-08 22:47:54] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2520 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (EQ s3 1) (EQ s63 1) (EQ s151 1) (EQ s315 1) (EQ s341 1) (EQ s411 1) (EQ s686 1) (EQ s694 1) (EQ s789 1) (EQ s826 1)) (AND (EQ s28 1) (EQ s29 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-00 finished in 2859 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 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 37 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 22:47:54] [INFO ] Invariant cache hit.
[2023-03-08 22:47:55] [INFO ] Implicit Places using invariants in 888 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 896 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 23 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 957 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s310 1) (EQ s592 1)) (AND (EQ s189 1) (EQ s388 1)) (AND (EQ s592 1) (EQ s709 1)) (AND (EQ s51 1) (EQ s271 1)) (AND (EQ s23 1) (EQ s592 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]]
Product exploration explored 100000 steps with 6029 reset in 1247 ms.
Product exploration explored 100000 steps with 6002 reset in 1146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 800 rows 730 cols
[2023-03-08 22:47:58] [INFO ] Computed 30 place invariants in 26 ms
[2023-03-08 22:48:00] [INFO ] [Real]Absence check using 21 positive place invariants in 122 ms returned sat
[2023-03-08 22:48:00] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 246 ms returned sat
[2023-03-08 22:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:48:14] [INFO ] [Real]Absence check using state equation in 13279 ms returned unknown
Could not prove EG (NOT p0)
Support contains 110 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 730 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 630 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 630 transition count 600
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 530 transition count 600
Applied a total of 400 rules in 125 ms. Remains 530 /730 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 530 cols
[2023-03-08 22:48:14] [INFO ] Computed 30 place invariants in 21 ms
[2023-03-08 22:48:14] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-08 22:48:14] [INFO ] Invariant cache hit.
[2023-03-08 22:48:17] [INFO ] Implicit Places using invariants and state equation in 3268 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
[2023-03-08 22:48:18] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-08 22:48:18] [INFO ] Invariant cache hit.
[2023-03-08 22:48:18] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/730 places, 600/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4675 ms. Remains : 530/730 places, 600/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-08 22:48:19] [INFO ] Invariant cache hit.
[2023-03-08 22:48:20] [INFO ] [Real]Absence check using 23 positive place invariants in 107 ms returned sat
[2023-03-08 22:48:20] [INFO ] [Real]Absence check using 23 positive and 7 generalized place invariants in 205 ms returned sat
[2023-03-08 22:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:48:29] [INFO ] [Real]Absence check using state equation in 9305 ms returned sat
[2023-03-08 22:48:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:48:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 91 ms returned sat
[2023-03-08 22:48:31] [INFO ] [Nat]Absence check using 23 positive and 7 generalized place invariants in 250 ms returned sat
[2023-03-08 22:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:48:37] [INFO ] [Nat]Absence check using state equation in 6415 ms returned sat
[2023-03-08 22:48:37] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2023-03-08 22:48:38] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-08 22:48:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-08 22:48:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-08 22:48:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-08 22:48:38] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-08 22:48:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-08 22:48:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-08 22:48:39] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-08 22:48:39] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2023-03-08 22:48:39] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 22:48:39] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1657 ms
[2023-03-08 22:48:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1658 ms
[2023-03-08 22:48:39] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-08 22:48:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-08 22:48:44] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-08 22:48:44] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 22:48:44] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-08 22:48:44] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-08 22:48:45] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1201 ms
[2023-03-08 22:48:45] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 22:48:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8194 reset in 1247 ms.
Product exploration explored 100000 steps with 8201 reset in 1256 ms.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 25 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-08 22:48:47] [INFO ] Invariant cache hit.
[2023-03-08 22:48:48] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-08 22:48:48] [INFO ] Invariant cache hit.
[2023-03-08 22:48:51] [INFO ] Implicit Places using invariants and state equation in 3177 ms returned []
Implicit Place search using SMT with State Equation took 3794 ms to find 0 implicit places.
[2023-03-08 22:48:51] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 22:48:51] [INFO ] Invariant cache hit.
[2023-03-08 22:48:52] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4541 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-01 finished in 57581 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 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 300 rules applied. Total rules applied 710 place count 520 transition count 400
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 49 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-08 22:48:52] [INFO ] Computed 120 place invariants in 5 ms
[2023-03-08 22:48:54] [INFO ] Implicit Places using invariants in 1948 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 37, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 212, 213, 214, 215, 216, 219, 220, 221, 222, 224, 226, 227, 229, 230, 231, 232, 234, 235, 236, 237, 238, 239, 240, 242, 244, 246, 248, 252, 256, 257, 258, 260, 261, 262, 264, 266, 267, 268, 271, 272, 274, 275, 276, 277, 278, 280, 281, 282, 283, 284, 286, 287, 288, 289, 290, 294, 296, 297, 298, 300, 301, 302, 305, 306, 307, 309, 310, 311, 312, 313, 316, 318]
[2023-03-08 22:48:54] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 24, 25, 26, 32, 36, 37, 39, 40, 46, 49, 50, 52, 54, 58, 61, 66, 67, 73, 74, 75, 81, 82, 86, 91, 92, 93, 96, 104, 105, 111, 113, 115, 116, 118, 120, 125, 127, 130, 132, 145, 146, 147, 153, 156, 157, 164, 165, 168, 173, 174, 178, 179, 184, 185, 188, 193, 198, 201, 202, 204, 205, 210, 212, 213, 214, 215, 216, 222, 231, 235, 238, 240, 244, 246, 256, 258, 262, 264, 272, 280, 281, 284, 286, 287, 289, 290, 294, 296, 301, 306, 309, 311, 318]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1958 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/830 places, 300/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 220 /220 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2013 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s73 1) (EQ s196 1)) (AND (EQ s1 1) (EQ s137 1)) (AND (EQ s30 1) (EQ s179 1)) (AND (EQ s4 1) (EQ s198 1)) (AND (EQ s34 1) (EQ s174 1)) (AND...], 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 50000 reset in 903 ms.
Product exploration explored 100000 steps with 50000 reset in 886 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-03 finished in 3984 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 10 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 830 transition count 600
Reduce places removed 210 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 410 rules applied. Total rules applied 610 place count 620 transition count 400
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 810 place count 420 transition count 300
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 44 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-08 22:48:56] [INFO ] Computed 120 place invariants in 10 ms
[2023-03-08 22:48:57] [INFO ] Implicit Places using invariants in 1442 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 37, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 212, 213, 214, 215, 216, 219, 220, 221, 222, 224, 226, 227, 229, 230, 231, 232, 234, 235, 236, 237, 238, 239, 240, 242, 244, 246, 248, 252, 256, 257, 258, 260, 261, 262, 264, 266, 267, 268, 271, 272, 274, 275, 276, 277, 278, 280, 281, 282, 283, 284, 286, 287, 288, 289, 290, 294, 296, 297, 298, 300, 301, 302, 305, 306, 307, 309, 310, 311, 312, 313, 316, 318]
[2023-03-08 22:48:57] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 24, 25, 26, 32, 36, 37, 39, 40, 46, 49, 50, 52, 54, 58, 61, 66, 67, 73, 74, 75, 81, 82, 86, 91, 92, 93, 96, 104, 105, 111, 113, 115, 116, 118, 120, 125, 127, 130, 132, 145, 146, 147, 153, 156, 157, 164, 165, 168, 173, 174, 178, 179, 184, 185, 188, 193, 198, 201, 202, 204, 205, 210, 212, 213, 214, 215, 216, 222, 231, 235, 238, 240, 244, 246, 256, 258, 262, 264, 272, 280, 281, 284, 286, 287, 289, 290, 294, 296, 301, 306, 309, 311, 318]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1449 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/830 places, 300/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1501 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s93 0) (EQ s51 0) (EQ s102 0) (EQ s184 0) (EQ s23 0) (EQ s9 0) (EQ s127 0) (EQ s42 0) (EQ s207 0) (EQ s7 0))], 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 7650 reset in 460 ms.
Stack based approach found an accepted trace after 661 steps with 50 reset with depth 8 and stack size 8 in 4 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-04 finished in 2017 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((G(F(p0))||(F(p1)&&G(p2))))))'
Support contains 400 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 700
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 730 transition count 700
Applied a total of 200 rules in 33 ms. Remains 730 /830 variables (removed 100) and now considering 700/800 (removed 100) transitions.
// Phase 1: matrix 700 rows 730 cols
[2023-03-08 22:48:58] [INFO ] Computed 130 place invariants in 5 ms
[2023-03-08 22:48:58] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-08 22:48:58] [INFO ] Invariant cache hit.
[2023-03-08 22:48:59] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2023-03-08 22:49:00] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 22:49:00] [INFO ] Invariant cache hit.
[2023-03-08 22:49:00] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/830 places, 700/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2285 ms. Remains : 730/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s459 0) (EQ s519 0) (EQ s577 0) (EQ s396 0) (EQ s523 0) (EQ s567 0) (EQ s406 0) (EQ s683 0) (EQ s181 0) (EQ s142 0) (EQ s33 0) (EQ s311 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1659 reset in 1046 ms.
Product exploration explored 100000 steps with 1684 reset in 1078 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Finished random walk after 182 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 400 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Applied a total of 0 rules in 18 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-08 22:49:04] [INFO ] Invariant cache hit.
[2023-03-08 22:49:04] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-08 22:49:04] [INFO ] Invariant cache hit.
[2023-03-08 22:49:05] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-08 22:49:05] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 22:49:05] [INFO ] Invariant cache hit.
[2023-03-08 22:49:06] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2352 ms. Remains : 730/730 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 216 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 392 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1680 reset in 1054 ms.
Product exploration explored 100000 steps with 1681 reset in 1074 ms.
Support contains 400 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 700/700 transitions.
Applied a total of 0 rules in 23 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-08 22:49:09] [INFO ] Invariant cache hit.
[2023-03-08 22:49:10] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-08 22:49:10] [INFO ] Invariant cache hit.
[2023-03-08 22:49:11] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2023-03-08 22:49:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 22:49:11] [INFO ] Invariant cache hit.
[2023-03-08 22:49:12] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2383 ms. Remains : 730/730 places, 700/700 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-05 finished in 13787 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' '!(!((p0 U p1) U (p0 U (X(X(G(p0))) U p2))))'
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-08 22:49:12] [INFO ] Computed 130 place invariants in 10 ms
[2023-03-08 22:49:13] [INFO ] Implicit Places using invariants in 946 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 950 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 972 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, p0, (AND p0 p2), p2, (AND p0 p2)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s126 1) (EQ s182 1) (EQ s237 1) (EQ s534 1) (EQ s471 1) (EQ s198 1) (EQ s633 1) (EQ s525 1) (EQ s635 1) (EQ s86 1) (EQ s498 1) (EQ s258 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2417 ms.
Product exploration explored 100000 steps with 33333 reset in 2470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 11 factoid took 223 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-06 finished in 6664 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((p1||X(p0))))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 200 place count 730 transition count 500
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 600 place count 530 transition count 500
Applied a total of 600 rules in 53 ms. Remains 530 /830 variables (removed 300) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 530 cols
[2023-03-08 22:49:19] [INFO ] Computed 130 place invariants in 12 ms
[2023-03-08 22:49:19] [INFO ] Implicit Places using invariants in 670 ms returned [13, 22, 29, 30, 40, 41, 47, 49, 63, 69, 72, 75, 88, 94, 95, 103, 120, 122, 139, 140, 142, 151, 157, 158, 162, 163, 166, 167, 174, 176, 181, 195, 199, 212, 214, 216, 223, 226, 231, 232, 245, 254, 262, 266, 267, 268, 277, 281, 285, 289, 290, 300, 302, 303, 312, 316, 320, 323, 345, 361, 362, 364, 368, 372, 373, 375, 377, 381, 384, 387, 388, 391, 396, 405, 415, 426, 429, 430, 441, 442, 443, 448, 455, 456, 457, 458, 459, 465, 466, 475, 487, 490, 493, 495, 501, 504, 510, 513, 515, 521]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 673 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/830 places, 500/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 738 ms. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s72 0) (EQ s345 0) (EQ s107 0) (EQ s6 0) (EQ s403 0) (EQ s285 0) (EQ s380 0) (EQ s247 0) (EQ s154 0) (EQ s86 0) (EQ s128 0) (EQ s92 0) (EQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2107 reset in 857 ms.
Product exploration explored 100000 steps with 2117 reset in 877 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 210 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 430 cols
[2023-03-08 22:49:22] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-08 22:49:22] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-08 22:49:22] [INFO ] Invariant cache hit.
[2023-03-08 22:49:23] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2023-03-08 22:49:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 22:49:23] [INFO ] Invariant cache hit.
[2023-03-08 22:49:24] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1937 ms. Remains : 430/430 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2140 reset in 879 ms.
Product exploration explored 100000 steps with 2133 reset in 917 ms.
Support contains 210 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-08 22:49:26] [INFO ] Invariant cache hit.
[2023-03-08 22:49:26] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-08 22:49:26] [INFO ] Invariant cache hit.
[2023-03-08 22:49:27] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2023-03-08 22:49:27] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 22:49:28] [INFO ] Invariant cache hit.
[2023-03-08 22:49:28] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2046 ms. Remains : 430/430 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-07 finished in 9657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 17 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-08 22:49:28] [INFO ] Computed 130 place invariants in 10 ms
[2023-03-08 22:49:29] [INFO ] Implicit Places using invariants in 1058 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1062 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1093 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s438 1), p1:(AND (EQ s139 1) (EQ s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Product exploration explored 100000 steps with 0 reset in 586 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 4190 steps, including 1 resets, run visited all 3 properties in 70 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 800 rows 730 cols
[2023-03-08 22:49:31] [INFO ] Computed 30 place invariants in 18 ms
[2023-03-08 22:49:32] [INFO ] [Real]Absence check using 21 positive place invariants in 41 ms returned sat
[2023-03-08 22:49:32] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 440 ms returned sat
[2023-03-08 22:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:38] [INFO ] [Real]Absence check using state equation in 5818 ms returned sat
[2023-03-08 22:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:49:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 55 ms returned sat
[2023-03-08 22:49:39] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 233 ms returned sat
[2023-03-08 22:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:49:41] [INFO ] [Nat]Absence check using state equation in 2559 ms returned sat
[2023-03-08 22:49:41] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2023-03-08 22:49:42] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-08 22:49:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 574 ms
[2023-03-08 22:49:42] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-08 22:49:49] [INFO ] Added : 414 causal constraints over 83 iterations in 7492 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 22:49:50] [INFO ] Invariant cache hit.
[2023-03-08 22:49:50] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-08 22:49:50] [INFO ] Invariant cache hit.
[2023-03-08 22:49:56] [INFO ] Implicit Places using invariants and state equation in 6004 ms returned []
Implicit Place search using SMT with State Equation took 6789 ms to find 0 implicit places.
[2023-03-08 22:49:56] [INFO ] Invariant cache hit.
[2023-03-08 22:49:58] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8161 ms. Remains : 730/730 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :1
Finished Best-First random walk after 4736 steps, including 1 resets, run visited all 2 properties in 11 ms. (steps per millisecond=430 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-08 22:49:59] [INFO ] Invariant cache hit.
[2023-03-08 22:49:59] [INFO ] [Real]Absence check using 21 positive place invariants in 53 ms returned sat
[2023-03-08 22:49:59] [INFO ] [Real]Absence check using 21 positive and 9 generalized place invariants in 109 ms returned sat
[2023-03-08 22:49:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:50:07] [INFO ] [Real]Absence check using state equation in 8175 ms returned sat
[2023-03-08 22:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:50:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 37 ms returned sat
[2023-03-08 22:50:08] [INFO ] [Nat]Absence check using 21 positive and 9 generalized place invariants in 248 ms returned sat
[2023-03-08 22:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:50:13] [INFO ] [Nat]Absence check using state equation in 4821 ms returned sat
[2023-03-08 22:50:13] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-08 22:50:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2023-03-08 22:50:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2023-03-08 22:50:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-08 22:50:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2023-03-08 22:50:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-08 22:50:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-08 22:50:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-08 22:50:15] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2023-03-08 22:50:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2023-03-08 22:50:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2023-03-08 22:50:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2213 ms
[2023-03-08 22:50:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2213 ms
[2023-03-08 22:50:15] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-08 22:50:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-08 22:50:20] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2023-03-08 22:50:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2023-03-08 22:50:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-08 22:50:21] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
[2023-03-08 22:50:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2023-03-08 22:50:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2023-03-08 22:50:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2045 ms
[2023-03-08 22:50:22] [INFO ] Added : 279 causal constraints over 56 iterations in 6595 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 521 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 730 transition count 800
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 99 Pre rules applied. Total rules applied 190 place count 730 transition count 800
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 289 place count 730 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 389 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 389 place count 730 transition count 800
Deduced a syphon composed of 389 places in 0 ms
Applied a total of 389 rules in 106 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 22:50:23] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2023-03-08 22:50:23] [INFO ] Computed 30 place invariants in 19 ms
[2023-03-08 22:50:25] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/730 places, 800/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 730/730 places, 800/800 transitions.
Support contains 3 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 730 cols
[2023-03-08 22:50:25] [INFO ] Computed 30 place invariants in 16 ms
[2023-03-08 22:50:25] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-08 22:50:25] [INFO ] Invariant cache hit.
[2023-03-08 22:53:06] [INFO ] Performed 475/730 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2023-03-08 22:53:06] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2023-03-08 22:53:06] [INFO ] Implicit Places using invariants and state equation in 160021 ms returned []
Implicit Place search using SMT with State Equation took 160873 ms to find 0 implicit places.
[2023-03-08 22:53:06] [INFO ] Invariant cache hit.
[2023-03-08 22:53:07] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162341 ms. Remains : 730/730 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-08 finished in 218927 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 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-08 22:53:07] [INFO ] Computed 130 place invariants in 12 ms
[2023-03-08 22:53:08] [INFO ] Implicit Places using invariants in 1062 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1095 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-10 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 (EQ s51 1) (EQ s54 1) (OR (EQ s364 0) (EQ s453 0)))], 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 DatabaseWithMutex-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-10 finished in 1223 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 12 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 830 transition count 611
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 1 with 370 rules applied. Total rules applied 559 place count 632 transition count 439
Reduce places removed 172 places and 0 transitions.
Iterating post reduction 2 with 172 rules applied. Total rules applied 731 place count 460 transition count 439
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 731 place count 460 transition count 331
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 947 place count 352 transition count 331
Applied a total of 947 rules in 32 ms. Remains 352 /830 variables (removed 478) and now considering 331/800 (removed 469) transitions.
// Phase 1: matrix 331 rows 352 cols
[2023-03-08 22:53:08] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-08 22:53:09] [INFO ] Implicit Places using invariants in 1189 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 20, 24, 26, 29, 31, 33, 35, 39, 40, 41, 42, 43, 45, 47, 49, 50, 52, 54, 56, 57, 59, 60, 61, 66, 67, 71, 72, 76, 77, 78, 80, 81, 88, 89, 90, 91, 92, 93, 97, 99, 101, 102, 103, 104, 105, 106, 109, 110, 112, 113, 115, 116, 119, 120, 123, 124, 126, 127, 128, 129, 134, 136, 137, 138, 139, 140, 144, 147, 151, 152, 159, 160, 164, 167, 169, 170, 171, 173, 176, 177, 178, 180, 185, 187, 189, 190, 191, 192, 194, 196, 197, 199, 200, 201, 202, 203, 205, 208, 211, 212, 215, 217, 221, 222, 224, 229, 230, 232, 234, 235, 236, 241, 242, 243, 245, 247, 248, 250, 251, 252, 253, 255, 256, 257, 258, 260, 261, 264, 266, 270, 276, 281, 282, 283, 286, 287, 289, 291, 293, 294, 295, 298, 299, 301, 302, 303, 304, 305, 307, 309, 310, 311, 313, 314, 315, 316, 317, 322, 324, 325, 326, 328, 329, 330, 333, 335, 336, 339, 342, 343, 346, 349]
[2023-03-08 22:53:09] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 20, 29, 35, 39, 40, 42, 43, 49, 52, 54, 57, 59, 66, 71, 72, 78, 80, 81, 88, 89, 93, 99, 101, 104, 112, 113, 119, 123, 124, 126, 128, 134, 136, 139, 159, 160, 167, 170, 171, 180, 190, 191, 196, 197, 202, 203, 211, 217, 221, 222, 224, 230, 232, 234, 235, 236, 243, 252, 256, 261, 266, 281, 283, 289, 291, 299, 307, 311, 313, 314, 316, 317, 322, 324, 329, 335, 349, 7, 10, 16, 17, 24, 26, 31, 33, 45, 47, 50, 56, 60, 61, 67, 76, 77, 90, 91, 92, 97, 102, 103, 106, 109, 110, 116, 120, 127, 129, 137, 140, 144, 147, 151, 152, 164, 169, 173, 176, 177, 178, 185, 187, 189, 192, 194, 200, 201, 205, 208, 212, 215, 229, 241, 245, 247, 248, 250, 251, 253, 255, 257, 258, 260, 270, 276, 282, 286, 287, 293, 294, 295, 301, 302, 303, 304, 305, 309, 310, 315, 325, 328, 330, 333, 336, 339, 342, 343, 346]
Discarding 172 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 172 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/830 places, 331/800 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 180 transition count 322
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 171 transition count 322
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 83 place count 106 transition count 257
Iterating global reduction 2 with 65 rules applied. Total rules applied 148 place count 106 transition count 257
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 166 place count 97 transition count 248
Applied a total of 166 rules in 19 ms. Remains 97 /180 variables (removed 83) and now considering 248/331 (removed 83) transitions.
// Phase 1: matrix 248 rows 97 cols
[2023-03-08 22:53:09] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-08 22:53:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 22:53:10] [INFO ] Invariant cache hit.
[2023-03-08 22:53:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/830 places, 248/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1371 ms. Remains : 97/830 places, 248/800 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-11 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:(OR (EQ s9 0) (EQ s43 0)), p1:(AND (EQ s13 1) (EQ s36 1) (EQ s50 1) (EQ s59 1) (EQ s69 1) (EQ s70 1) (EQ s78 1) (EQ s80 1) (EQ s87 1) (EQ s94 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 374 ms.
Stack based approach found an accepted trace after 1685 steps with 0 reset with depth 1686 and stack size 1666 in 7 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-11 finished in 1884 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 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 830 transition count 601
Reduce places removed 208 places and 0 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 1 with 388 rules applied. Total rules applied 587 place count 622 transition count 421
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 767 place count 442 transition count 421
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 767 place count 442 transition count 311
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 987 place count 332 transition count 311
Applied a total of 987 rules in 35 ms. Remains 332 /830 variables (removed 498) and now considering 311/800 (removed 489) transitions.
// Phase 1: matrix 311 rows 332 cols
[2023-03-08 22:53:10] [INFO ] Computed 121 place invariants in 11 ms
[2023-03-08 22:53:12] [INFO ] Implicit Places using invariants in 1357 ms returned [0, 4, 7, 10, 12, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 37, 38, 39, 40, 41, 43, 45, 47, 48, 51, 52, 53, 56, 58, 59, 61, 64, 66, 70, 71, 75, 76, 77, 78, 79, 85, 86, 87, 88, 89, 90, 94, 95, 96, 97, 98, 99, 100, 101, 102, 105, 106, 108, 111, 112, 116, 117, 120, 121, 123, 124, 126, 130, 133, 134, 135, 137, 138, 141, 142, 146, 147, 151, 152, 153, 156, 159, 162, 163, 164, 166, 167, 168, 169, 171, 172, 175, 176, 177, 179, 180, 181, 182, 183, 185, 186, 188, 189, 190, 192, 194, 195, 197, 200, 201, 203, 206, 209, 210, 212, 213, 217, 219, 221, 222, 223, 224, 225, 228, 229, 230, 233, 235, 236, 238, 239, 240, 241, 243, 244, 245, 246, 247, 248, 249, 251, 253, 255, 257, 261, 266, 267, 268, 270, 271, 273, 275, 277, 278, 279, 282, 285, 286, 287, 288, 289, 291, 292, 293, 294, 295, 297, 298, 299, 300, 305, 307, 309, 310, 312, 313, 314, 317, 318, 319, 321, 322, 323, 324, 325, 328, 330]
[2023-03-08 22:53:12] [INFO ] Actually due to overlaps returned [0, 4, 12, 14, 18, 19, 24, 25, 26, 32, 37, 38, 40, 41, 47, 51, 52, 56, 61, 64, 70, 71, 77, 78, 79, 85, 86, 90, 95, 96, 97, 100, 108, 117, 120, 121, 123, 130, 133, 138, 151, 152, 153, 159, 163, 164, 171, 172, 175, 180, 181, 185, 186, 192, 195, 200, 206, 209, 210, 212, 213, 219, 221, 222, 223, 224, 225, 240, 244, 247, 249, 253, 255, 266, 268, 273, 275, 291, 292, 295, 297, 298, 300, 305, 307, 313, 318, 321, 323, 330, 7, 10, 16, 17, 22, 23, 28, 30, 39, 43, 45, 48, 53, 58, 59, 66, 76, 87, 88, 89, 94, 99, 101, 102, 105, 106, 111, 112, 116, 126, 134, 135, 137, 141, 142, 146, 147, 156, 162, 166, 167, 169, 176, 177, 179, 182, 183, 188, 189, 190, 194, 197, 203, 217, 229, 230, 233, 236, 238, 239, 241, 243, 245, 246, 248, 251, 257, 261, 267, 270, 271, 277, 278, 279, 282, 285, 287, 288, 293, 299, 309, 310, 312, 314, 317, 319, 322, 324, 325, 328]
Discarding 180 places :
Implicit Place search using SMT only with invariants took 1364 ms to find 180 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/830 places, 311/800 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 152 transition count 301
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 142 transition count 301
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 92 place count 70 transition count 229
Iterating global reduction 2 with 72 rules applied. Total rules applied 164 place count 70 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 69 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 69 transition count 219
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 176 place count 69 transition count 209
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 196 place count 59 transition count 199
Applied a total of 196 rules in 13 ms. Remains 59 /152 variables (removed 93) and now considering 199/311 (removed 112) transitions.
// Phase 1: matrix 199 rows 59 cols
[2023-03-08 22:53:12] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 22:53:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 22:53:12] [INFO ] Invariant cache hit.
[2023-03-08 22:53:12] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/830 places, 199/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1523 ms. Remains : 59/830 places, 199/800 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 284 ms.
Stack based approach found an accepted trace after 416 steps with 0 reset with depth 417 and stack size 411 in 2 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-13 finished in 1854 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 21 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2023-03-08 22:53:12] [INFO ] Computed 130 place invariants in 17 ms
[2023-03-08 22:53:13] [INFO ] Implicit Places using invariants in 1065 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1067 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 19 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1108 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s487 1) (EQ s637 1)), p2:(AND (NOT (AND (EQ s487 1) (EQ s637 1))) (NOT (AND (EQ s579 1) (EQ s655 1)))), p1:(AND (EQ s579 1) (EQ s655 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 DatabaseWithMutex-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-14 finished in 1231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 11 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 830 transition count 602
Reduce places removed 208 places and 0 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 399 rules applied. Total rules applied 597 place count 622 transition count 411
Reduce places removed 191 places and 0 transitions.
Iterating post reduction 2 with 191 rules applied. Total rules applied 788 place count 431 transition count 411
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 788 place count 431 transition count 311
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 988 place count 331 transition count 311
Applied a total of 988 rules in 32 ms. Remains 331 /830 variables (removed 499) and now considering 311/800 (removed 489) transitions.
// Phase 1: matrix 311 rows 331 cols
[2023-03-08 22:53:13] [INFO ] Computed 120 place invariants in 6 ms
[2023-03-08 22:53:15] [INFO ] Implicit Places using invariants in 1302 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 19, 22, 23, 24, 25, 26, 28, 30, 32, 37, 38, 39, 40, 41, 43, 45, 47, 48, 50, 51, 52, 53, 56, 57, 59, 62, 64, 68, 73, 74, 75, 76, 77, 83, 84, 85, 86, 87, 88, 92, 94, 95, 97, 98, 99, 100, 103, 104, 106, 107, 109, 110, 113, 114, 115, 117, 118, 120, 121, 122, 123, 127, 131, 132, 133, 134, 135, 136, 139, 141, 145, 146, 150, 151, 152, 155, 158, 160, 162, 164, 165, 166, 167, 170, 171, 174, 175, 176, 178, 179, 180, 181, 182, 185, 187, 188, 189, 190, 191, 193, 194, 196, 199, 200, 202, 207, 208, 210, 211, 215, 216, 218, 219, 220, 221, 222, 225, 226, 227, 228, 230, 232, 233, 235, 236, 237, 238, 240, 241, 242, 243, 244, 246, 247, 249, 253, 255, 259, 263, 264, 265, 267, 268, 269, 271, 273, 274, 275, 278, 279, 281, 282, 284, 285, 286, 288, 289, 290, 291, 292, 294, 296, 297, 298, 302, 304, 305, 307, 309, 310, 311, 315, 316, 317, 320, 321, 322, 323, 324, 327, 329]
[2023-03-08 22:53:15] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 19, 24, 25, 26, 32, 37, 38, 40, 41, 47, 50, 51, 53, 59, 62, 68, 75, 76, 77, 83, 84, 88, 94, 95, 98, 106, 107, 113, 115, 117, 118, 120, 122, 127, 131, 134, 136, 150, 151, 152, 158, 162, 170, 171, 174, 179, 180, 185, 190, 191, 194, 199, 207, 208, 210, 211, 216, 218, 219, 220, 221, 222, 228, 237, 241, 244, 247, 253, 263, 265, 269, 271, 279, 288, 289, 292, 294, 297, 298, 302, 304, 310, 316, 320, 322, 329, 23, 97, 133, 135, 189, 215, 236, 267, 315]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1307 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/830 places, 311/800 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 231 transition count 222
Reduce places removed 97 places and 0 transitions.
Graph (trivial) has 180 edges and 134 vertex of which 90 / 134 are part of one of the 10 SCC in 2 ms
Free SCC test removed 80 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 188 place count 54 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 151 rules applied. Total rules applied 339 place count 53 transition count 71
Applied a total of 339 rules in 8 ms. Remains 53 /231 variables (removed 178) and now considering 71/311 (removed 240) transitions.
[2023-03-08 22:53:15] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 53 cols
[2023-03-08 22:53:15] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-08 22:53:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 22:53:15] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2023-03-08 22:53:15] [INFO ] Invariant cache hit.
[2023-03-08 22:53:15] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/830 places, 71/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1433 ms. Remains : 53/830 places, 71/800 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s16 1), p1:(OR (EQ s4 0) (EQ s8 0) (EQ s12 0) (EQ s15 0) (EQ s17 0) (EQ s23 0) (EQ s31 0) (EQ s39 0) (EQ s43 0) (EQ s47 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-15 finished in 1637 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)))'
Found a Shortening insensitive property : DatabaseWithMutex-PT-10-LTLFireability-01
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 730 transition count 600
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 44 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 630 cols
[2023-03-08 22:53:15] [INFO ] Computed 130 place invariants in 5 ms
[2023-03-08 22:53:16] [INFO ] Implicit Places using invariants in 668 ms returned [15, 26, 37, 38, 50, 51, 58, 61, 75, 86, 90, 93, 108, 114, 115, 124, 141, 144, 166, 167, 169, 178, 185, 186, 190, 191, 195, 197, 204, 206, 212, 228, 232, 249, 251, 253, 264, 268, 274, 277, 292, 302, 310, 316, 317, 318, 328, 333, 337, 341, 343, 354, 358, 360, 370, 374, 379, 382, 408, 427, 428, 430, 435, 439, 440, 442, 444, 448, 451, 454, 456, 460, 465, 479, 491, 504, 507, 509, 522, 523, 525, 530, 537, 538, 539, 541, 542, 552, 553, 563, 575, 578, 581, 583, 591, 594, 604, 607, 609, 620]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 672 ms to find 100 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 530/830 places, 600/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 733 ms. Remains : 530/830 places, 600/800 transitions.
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s228 1) (EQ s433 1)) (AND (EQ s141 1) (EQ s285 1)) (AND (EQ s433 1) (EQ s512 1)) (AND (EQ s37 1) (EQ s201 1)) (AND (EQ s18 1) (EQ s433 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8190 reset in 1194 ms.
Product exploration explored 100000 steps with 8160 reset in 1201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 600 rows 530 cols
[2023-03-08 22:53:19] [INFO ] Computed 30 place invariants in 34 ms
[2023-03-08 22:53:20] [INFO ] [Real]Absence check using 23 positive place invariants in 115 ms returned sat
[2023-03-08 22:53:20] [INFO ] [Real]Absence check using 23 positive and 7 generalized place invariants in 184 ms returned sat
[2023-03-08 22:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:53:32] [INFO ] [Real]Absence check using state equation in 12417 ms returned sat
[2023-03-08 22:53:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:53:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 89 ms returned sat
[2023-03-08 22:53:34] [INFO ] [Nat]Absence check using 23 positive and 7 generalized place invariants in 100 ms returned sat
[2023-03-08 22:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:53:43] [INFO ] [Nat]Absence check using state equation in 9324 ms returned sat
[2023-03-08 22:53:43] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-08 22:53:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-08 22:53:43] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-08 22:53:44] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-08 22:53:44] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-08 22:53:44] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-08 22:53:44] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-08 22:53:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2023-03-08 22:53:45] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-08 22:53:45] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-08 22:53:45] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-08 22:53:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2226 ms
[2023-03-08 22:53:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2226 ms
[2023-03-08 22:53:45] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-08 22:53:47] [INFO ] Added : 80 causal constraints over 16 iterations in 2263 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 17 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-08 22:53:47] [INFO ] Invariant cache hit.
[2023-03-08 22:53:48] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-08 22:53:48] [INFO ] Invariant cache hit.
[2023-03-08 22:53:51] [INFO ] Implicit Places using invariants and state equation in 3254 ms returned []
Implicit Place search using SMT with State Equation took 3872 ms to find 0 implicit places.
[2023-03-08 22:53:51] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 22:53:51] [INFO ] Invariant cache hit.
[2023-03-08 22:53:52] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4568 ms. Remains : 530/530 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-08 22:53:52] [INFO ] Invariant cache hit.
[2023-03-08 22:53:54] [INFO ] [Real]Absence check using 23 positive place invariants in 109 ms returned sat
[2023-03-08 22:53:54] [INFO ] [Real]Absence check using 23 positive and 7 generalized place invariants in 213 ms returned sat
[2023-03-08 22:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:54:03] [INFO ] [Real]Absence check using state equation in 9466 ms returned sat
[2023-03-08 22:54:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:54:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 90 ms returned sat
[2023-03-08 22:54:05] [INFO ] [Nat]Absence check using 23 positive and 7 generalized place invariants in 254 ms returned sat
[2023-03-08 22:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:54:11] [INFO ] [Nat]Absence check using state equation in 6522 ms returned sat
[2023-03-08 22:54:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-08 22:54:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-08 22:54:12] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 9 ms to minimize.
[2023-03-08 22:54:13] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-08 22:54:13] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-08 22:54:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1596 ms
[2023-03-08 22:54:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1597 ms
[2023-03-08 22:54:13] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-08 22:54:17] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-08 22:54:17] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-08 22:54:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 22:54:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-08 22:54:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-08 22:54:18] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1419 ms
[2023-03-08 22:54:19] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 22:54:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8173 reset in 1241 ms.
Product exploration explored 100000 steps with 8192 reset in 1257 ms.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 11 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-08 22:54:21] [INFO ] Invariant cache hit.
[2023-03-08 22:54:22] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-08 22:54:22] [INFO ] Invariant cache hit.
[2023-03-08 22:54:25] [INFO ] Implicit Places using invariants and state equation in 3025 ms returned []
Implicit Place search using SMT with State Equation took 3635 ms to find 0 implicit places.
[2023-03-08 22:54:25] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 22:54:25] [INFO ] Invariant cache hit.
[2023-03-08 22:54:25] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4342 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-01 finished in 70664 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((G(F(p0))||(F(p1)&&G(p2))))))'
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((p1||X(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Found a Shortening insensitive property : DatabaseWithMutex-PT-10-LTLFireability-08
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 830 transition count 610
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 1 with 379 rules applied. Total rules applied 569 place count 631 transition count 430
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 749 place count 451 transition count 430
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 749 place count 451 transition count 321
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 967 place count 342 transition count 321
Applied a total of 967 rules in 31 ms. Remains 342 /830 variables (removed 488) and now considering 321/800 (removed 479) transitions.
// Phase 1: matrix 321 rows 342 cols
[2023-03-08 22:54:26] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-08 22:54:27] [INFO ] Implicit Places using invariants in 1360 ms returned [0, 4, 7, 11, 13, 14, 15, 17, 18, 19, 20, 23, 24, 25, 26, 27, 29, 31, 33, 37, 38, 39, 40, 41, 43, 45, 48, 50, 54, 55, 57, 58, 59, 61, 65, 66, 71, 76, 78, 79, 80, 81, 87, 88, 89, 90, 91, 92, 96, 97, 98, 99, 100, 101, 102, 103, 104, 107, 108, 110, 111, 113, 114, 117, 118, 119, 122, 123, 125, 126, 128, 129, 133, 137, 138, 139, 140, 144, 145, 149, 150, 154, 155, 156, 160, 163, 165, 166, 167, 169, 170, 171, 172, 175, 178, 179, 182, 184, 185, 186, 187, 188, 190, 191, 193, 194, 195, 196, 197, 199, 200, 202, 205, 206, 208, 210, 214, 215, 217, 218, 223, 224, 226, 227, 229, 233, 234, 235, 236, 238, 241, 242, 244, 245, 246, 247, 249, 250, 251, 252, 253, 255, 256, 258, 260, 263, 265, 270, 274, 275, 276, 278, 279, 282, 284, 285, 286, 289, 290, 292, 293, 294, 295, 296, 298, 299, 300, 301, 302, 304, 305, 306, 307, 308, 312, 314, 315, 317, 319, 321, 325, 326, 327, 329, 330, 331, 332, 334, 337, 340]
[2023-03-08 22:54:27] [INFO ] Actually due to overlaps returned [0, 4, 13, 14, 15, 19, 20, 25, 26, 27, 33, 37, 38, 40, 41, 50, 55, 57, 61, 65, 71, 79, 80, 81, 87, 88, 92, 97, 98, 99, 102, 110, 111, 117, 119, 122, 123, 125, 128, 133, 139, 154, 155, 156, 163, 166, 167, 175, 178, 185, 186, 190, 191, 196, 197, 200, 205, 210, 214, 215, 217, 218, 224, 226, 227, 229, 236, 246, 250, 253, 256, 260, 263, 274, 276, 282, 290, 298, 299, 302, 304, 305, 307, 308, 312, 314, 326, 329, 331, 340, 7, 11, 18, 23, 24, 29, 31, 39, 43, 45, 48, 54, 58, 59, 76, 78, 89, 90, 96, 100, 101, 103, 104, 107, 108, 113, 114, 126, 129, 137, 138, 140, 144, 145, 149, 160, 165, 169, 170, 171, 172, 179, 184, 188, 193, 194, 195, 199, 202, 206, 208, 233, 234, 235, 238, 241, 242, 244, 245, 247, 249, 252, 255, 258, 265, 270, 275, 278, 279, 284, 286, 289, 292, 293, 294, 295, 296, 300, 301, 306, 315, 317, 319, 321, 325, 327, 330, 332, 334, 337]
Discarding 180 places :
Implicit Place search using SMT only with invariants took 1366 ms to find 180 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 162/830 places, 321/800 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 162 transition count 311
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 152 transition count 311
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 92 place count 80 transition count 239
Iterating global reduction 2 with 72 rules applied. Total rules applied 164 place count 80 transition count 239
Partial Post-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 244 place count 80 transition count 239
Applied a total of 244 rules in 6 ms. Remains 80 /162 variables (removed 82) and now considering 239/321 (removed 82) transitions.
// Phase 1: matrix 239 rows 80 cols
[2023-03-08 22:54:27] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-08 22:54:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 22:54:27] [INFO ] Invariant cache hit.
[2023-03-08 22:54:27] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 80/830 places, 239/800 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1522 ms. Remains : 80/830 places, 239/800 transitions.
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s52 1), p1:(AND (EQ s21 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 0 ms.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-08 finished in 2057 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 22:54:28] [INFO ] Flatten gal took : 65 ms
[2023-03-08 22:54:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2023-03-08 22:54:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 830 places, 800 transitions and 3800 arcs took 4 ms.
Total runtime 399890 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DatabaseWithMutex-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA DatabaseWithMutex-PT-10-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-10-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-10-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678316115597
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 DatabaseWithMutex-PT-10-LTLFireability-05
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DatabaseWithMutex-PT-10-LTLFireability-05
lola: result : false
lola: markings : 447
lola: fired transitions : 485
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DatabaseWithMutex-PT-10-LTLFireability-08
lola: time limit : 1196 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for DatabaseWithMutex-PT-10-LTLFireability-08
lola: result : false
lola: markings : 251
lola: fired transitions : 251
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DatabaseWithMutex-PT-10-LTLFireability-07
lola: time limit : 1794 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DatabaseWithMutex-PT-10-LTLFireability-07
lola: result : false
lola: markings : 306
lola: fired transitions : 306
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DatabaseWithMutex-PT-10-LTLFireability-01
lola: time limit : 3589 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3589 6/32 DatabaseWithMutex-PT-10-LTLFireability-01 446673 m, 89334 m/sec, 484855 t fired, .
Time elapsed: 16 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3589 11/32 DatabaseWithMutex-PT-10-LTLFireability-01 904559 m, 91577 m/sec, 1002447 t fired, .
Time elapsed: 21 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3589 16/32 DatabaseWithMutex-PT-10-LTLFireability-01 1365492 m, 92186 m/sec, 1505264 t fired, .
Time elapsed: 26 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3589 22/32 DatabaseWithMutex-PT-10-LTLFireability-01 1819876 m, 90876 m/sec, 2020510 t fired, .
Time elapsed: 31 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3589 27/32 DatabaseWithMutex-PT-10-LTLFireability-01 2271009 m, 90226 m/sec, 2533801 t fired, .
Time elapsed: 36 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3589 32/32 DatabaseWithMutex-PT-10-LTLFireability-01 2728553 m, 91508 m/sec, 3031135 t fired, .
Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for DatabaseWithMutex-PT-10-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-PT-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-PT-10-LTLFireability-01: LTL unknown AGGR
DatabaseWithMutex-PT-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-PT-10-LTLFireability-08: LTL false LTL model checker
Time elapsed: 46 secs. Pages in use: 32
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-10"
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-10, 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-167814479101076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-10.tgz
mv DatabaseWithMutex-PT-10 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 '
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 ;