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-167814479101036.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-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479101036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 13:20 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 3.8K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 27K 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-COL-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678311307920

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-COL-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 21:35:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 21:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:35:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-08 21:35:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-08 21:35:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 631 ms
[2023-03-08 21:35:10] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-08 21:35:10] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2023-03-08 21:35:10] [INFO ] Skeletonized 16 HLPN properties in 8 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 264 steps, including 0 resets, run visited all 10 properties in 10 ms. (steps per millisecond=26 )
[2023-03-08 21:35:10] [INFO ] Flatten gal took : 14 ms
[2023-03-08 21:35:10] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2023-03-08 21:35:10] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 31 ms.
[2023-03-08 21:35:10] [INFO ] Unfolded 15 HLPN properties in 2 ms.
[2023-03-08 21:35:10] [INFO ] Reduced 90 identical enabling conditions.
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 16 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 21:35:10] [INFO ] Computed 130 place invariants in 48 ms
[2023-03-08 21:35:10] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-08 21:35:10] [INFO ] Invariant cache hit.
[2023-03-08 21:35:11] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-08 21:35:11] [INFO ] Invariant cache hit.
[2023-03-08 21:35:11] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1219 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2023-03-08 21:35:11] [INFO ] Flatten gal took : 124 ms
[2023-03-08 21:35:12] [INFO ] Flatten gal took : 108 ms
[2023-03-08 21:35:12] [INFO ] Input system was already deterministic with 800 transitions.
Finished random walk after 219 steps, including 0 resets, run visited all 13 properties in 30 ms. (steps per millisecond=7 )
FORMULA DatabaseWithMutex-COL-10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DatabaseWithMutex-COL-10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((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 21:35:13] [INFO ] Invariant cache hit.
[2023-03-08 21:35:13] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-08 21:35:13] [INFO ] Invariant cache hit.
[2023-03-08 21:35:14] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-03-08 21:35:14] [INFO ] Invariant cache hit.
[2023-03-08 21:35:14] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-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 (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], 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-COL-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-00 finished in 1832 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 43 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:35:15] [INFO ] Invariant cache hit.
[2023-03-08 21:35:15] [INFO ] Implicit Places using invariants in 523 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 545 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 20 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 608 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-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 (GEQ s1 1) (GEQ s520 1)) (AND (GEQ s60 1) (GEQ s526 1)) (AND (GEQ s36 1) (GEQ s523 1)) (AND (GEQ s74 1) (GEQ s527 1)) (AND (GEQ s15 1) (GEQ s5...], 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 6020 reset in 719 ms.
Product exploration explored 100000 steps with 6019 reset in 659 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 119 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 26 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 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 21:35:17] [INFO ] Computed 30 place invariants in 34 ms
[2023-03-08 21:35:18] [INFO ] [Real]Absence check using 26 positive place invariants in 105 ms returned sat
[2023-03-08 21:35:18] [INFO ] [Real]Absence check using 26 positive and 4 generalized place invariants in 24 ms returned sat
[2023-03-08 21:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:35:22] [INFO ] [Real]Absence check using state equation in 3043 ms returned sat
[2023-03-08 21:35:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:35:23] [INFO ] [Nat]Absence check using 26 positive place invariants in 49 ms returned sat
[2023-03-08 21:35:23] [INFO ] [Nat]Absence check using 26 positive and 4 generalized place invariants in 117 ms returned sat
[2023-03-08 21:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:35:25] [INFO ] [Nat]Absence check using state equation in 2154 ms returned sat
[2023-03-08 21:35:25] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 4 ms to minimize.
[2023-03-08 21:35:25] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 1 ms to minimize.
[2023-03-08 21:35:26] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2023-03-08 21:35:26] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 2 ms to minimize.
[2023-03-08 21:35:26] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2023-03-08 21:35:26] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2023-03-08 21:35:27] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2023-03-08 21:35:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-03-08 21:35:27] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2023-03-08 21:35:27] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2023-03-08 21:35:27] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2023-03-08 21:35:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2299 ms
[2023-03-08 21:35:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2299 ms
[2023-03-08 21:35:27] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-08 21:35:34] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-03-08 21:35:34] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-08 21:35:34] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2023-03-08 21:35:35] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-03-08 21:35:35] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-03-08 21:35:35] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-08 21:35:35] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
[2023-03-08 21:35:35] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-08 21:35:36] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-08 21:35:36] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-08 21:35:36] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2023-03-08 21:35:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2515 ms
[2023-03-08 21:35:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2515 ms
[2023-03-08 21:35:37] [INFO ] Added : 480 causal constraints over 96 iterations in 9379 ms. Result :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 0 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 75 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 21:35:37] [INFO ] Computed 30 place invariants in 17 ms
[2023-03-08 21:35:37] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-08 21:35:37] [INFO ] Invariant cache hit.
[2023-03-08 21:35:38] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2023-03-08 21:35:38] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-08 21:35:38] [INFO ] Invariant cache hit.
[2023-03-08 21:35:38] [INFO ] Dead Transitions using invariants and state equation in 293 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 1799 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 165 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 12 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 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-08 21:35:39] [INFO ] Invariant cache hit.
[2023-03-08 21:35:40] [INFO ] [Real]Absence check using 28 positive place invariants in 77 ms returned sat
[2023-03-08 21:35:40] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-08 21:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:35:43] [INFO ] [Real]Absence check using state equation in 2650 ms returned sat
[2023-03-08 21:35:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:35:44] [INFO ] [Nat]Absence check using 28 positive place invariants in 41 ms returned sat
[2023-03-08 21:35:44] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 54 ms returned sat
[2023-03-08 21:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:35:45] [INFO ] [Nat]Absence check using state equation in 1784 ms returned sat
[2023-03-08 21:35:45] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-08 21:35:46] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-08 21:35:47] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-08 21:35:47] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-08 21:35:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1308 ms
[2023-03-08 21:35:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1309 ms
[2023-03-08 21:35:47] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-08 21:35:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-08 21:35:49] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 4 ms to minimize.
[2023-03-08 21:35:49] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-08 21:35:49] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:35:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1406 ms
[2023-03-08 21:35:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1407 ms
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 21:35:51] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1232 ms
[2023-03-08 21:35:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1232 ms
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 21:35:52] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1195 ms
[2023-03-08 21:35:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1196 ms
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-08 21:35:53] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-08 21:35:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1114 ms
[2023-03-08 21:35:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1114 ms
[2023-03-08 21:35:54] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-08 21:35:55] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-08 21:35:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-08 21:35:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-08 21:35:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-08 21:35:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-08 21:35:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-08 21:35:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-08 21:35:56] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-08 21:35:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-08 21:35:57] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-08 21:35:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2159 ms
[2023-03-08 21:35:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2159 ms
[2023-03-08 21:35:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-08 21:35:57] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 21:35:58] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-08 21:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1003 ms
[2023-03-08 21:35:58] [INFO ] Deduced a trap composed of 9 places in 238 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 21:35:58] [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 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8186 reset in 726 ms.
Product exploration explored 100000 steps with 8209 reset in 747 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 20 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-08 21:35:59] [INFO ] Invariant cache hit.
[2023-03-08 21:36:00] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-08 21:36:00] [INFO ] Invariant cache hit.
[2023-03-08 21:36:01] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2023-03-08 21:36:01] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 21:36:01] [INFO ] Invariant cache hit.
[2023-03-08 21:36:01] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1916 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-01 finished in 46800 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 0 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 46 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 21:36:02] [INFO ] Computed 120 place invariants in 6 ms
[2023-03-08 21:36:02] [INFO ] Implicit Places using invariants in 623 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2023-03-08 21:36:02] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 626 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 5 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 679 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s115 1) (GEQ s185 1)) (AND (GEQ s112 1) (GEQ s212 1)) (AND (GEQ s117 1) (GEQ s217 1)) (AND (GEQ s116 1) (GEQ s146 1)) (AND (GEQ s113 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 846 ms.
Product exploration explored 100000 steps with 50000 reset in 845 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 115 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-COL-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-03 finished in 2553 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 39 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 21:36:04] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-08 21:36:05] [INFO ] Implicit Places using invariants in 639 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2023-03-08 21:36:05] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 641 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 686 ms. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1 1) (LT s0 1) (LT s3 1) (LT s2 1) (LT s6 1) (LT s4 1) (LT s7 1) (LT s5 1) (LT s8 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7652 reset in 318 ms.
Stack based approach found an accepted trace after 4062 steps with 315 reset with depth 13 and stack size 13 in 15 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-04 finished in 1069 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 31 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 21:36:05] [INFO ] Computed 130 place invariants in 13 ms
[2023-03-08 21:36:05] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-08 21:36:05] [INFO ] Invariant cache hit.
[2023-03-08 21:36:06] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2023-03-08 21:36:06] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 21:36:06] [INFO ] Invariant cache hit.
[2023-03-08 21:36:06] [INFO ] Dead Transitions using invariants and state equation in 378 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 1307 ms. Remains : 730/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : DatabaseWithMutex-COL-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) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s291 1) (LT s226 1) (LT s287 1) (LT s222 1) (LT s299 1) (LT s234 1) (LT s295 1) (LT s230 1) (LT s307 1) (LT s242 1) (LT s303 1) (LT s238 1) (L...], 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 1672 reset in 806 ms.
Product exploration explored 100000 steps with 1737 reset in 808 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 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 245 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 89 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Finished random walk after 117 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 6 factoid took 270 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 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) 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 14 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-08 21:36:09] [INFO ] Invariant cache hit.
[2023-03-08 21:36:10] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-08 21:36:10] [INFO ] Invariant cache hit.
[2023-03-08 21:36:10] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2023-03-08 21:36:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 21:36:10] [INFO ] Invariant cache hit.
[2023-03-08 21:36:10] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1228 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 p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 267 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 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Finished random walk after 235 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 6 factoid took 447 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 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 1685 reset in 801 ms.
Product exploration explored 100000 steps with 1650 reset in 818 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 13 ms. Remains 730 /730 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-08 21:36:13] [INFO ] Invariant cache hit.
[2023-03-08 21:36:14] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-08 21:36:14] [INFO ] Invariant cache hit.
[2023-03-08 21:36:14] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-08 21:36:14] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:36:14] [INFO ] Invariant cache hit.
[2023-03-08 21:36:15] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1273 ms. Remains : 730/730 places, 700/700 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-05 finished in 9587 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 9 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 21:36:15] [INFO ] Computed 130 place invariants in 9 ms
[2023-03-08 21:36:15] [INFO ] Implicit Places using invariants in 527 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 530 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 13 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 553 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, p0, (AND p0 p2), p2, (AND p0 p2)]
Running random walk in product with property : DatabaseWithMutex-COL-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 (GEQ s161 1) (GEQ s157 1) (GEQ s169 1) (GEQ s165 1) (GEQ s177 1) (GEQ s173 1) (GEQ s185 1) (GEQ s181 1) (GEQ s120 1) (GEQ s193 1) (GEQ s124 1) (GEQ...], 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 1451 ms.
Product exploration explored 100000 steps with 33333 reset in 1463 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 (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 p2))))
Knowledge based reduction with 11 factoid took 232 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-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-06 finished in 4103 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 37 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 21:36:19] [INFO ] Computed 130 place invariants in 10 ms
[2023-03-08 21:36:19] [INFO ] Implicit Places using invariants in 494 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 504 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 15 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 557 ms. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s251 1) (GEQ s312 1) (GEQ s255 1) (GEQ s316 1) (GEQ s243 1) (GEQ s304 1) (GEQ s247 1) (GEQ s308 1) (GEQ s267 1) (GEQ s328 1) (GEQ s271 1) (GEQ...], 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 2135 reset in 714 ms.
Product exploration explored 100000 steps with 2134 reset in 719 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 p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 96 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 160 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 132 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 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 6 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 21:36:22] [INFO ] Computed 30 place invariants in 13 ms
[2023-03-08 21:36:22] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-08 21:36:22] [INFO ] Invariant cache hit.
[2023-03-08 21:36:22] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-03-08 21:36:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:36:23] [INFO ] Invariant cache hit.
[2023-03-08 21:36:23] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1225 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 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 54 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 106 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 75 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 2120 reset in 705 ms.
Product exploration explored 100000 steps with 2096 reset in 717 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 6 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-08 21:36:25] [INFO ] Invariant cache hit.
[2023-03-08 21:36:25] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-08 21:36:25] [INFO ] Invariant cache hit.
[2023-03-08 21:36:26] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-08 21:36:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:36:26] [INFO ] Invariant cache hit.
[2023-03-08 21:36:26] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1170 ms. Remains : 430/430 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-07 finished in 7149 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((G((F(!p1)&&F(G(!p2))))||p0))))'
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 12 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 21:36:26] [INFO ] Computed 130 place invariants in 14 ms
[2023-03-08 21:36:26] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 21:36:26] [INFO ] Invariant cache hit.
[2023-03-08 21:36:27] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-08 21:36:27] [INFO ] Invariant cache hit.
[2023-03-08 21:36:27] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1069 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6023 reset in 1777 ms.
Product exploration explored 100000 steps with 6022 reset in 1770 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 (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:36:32] [INFO ] Invariant cache hit.
[2023-03-08 21:36:32] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 9 factoid took 306 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
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 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:36:32] [INFO ] Invariant cache hit.
[2023-03-08 21:36:33] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 21:36:33] [INFO ] Invariant cache hit.
[2023-03-08 21:36:33] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-03-08 21:36:33] [INFO ] Invariant cache hit.
[2023-03-08 21:36:34] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1129 ms. Remains : 830/830 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 (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 265 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 6036 reset in 1517 ms.
Product exploration explored 100000 steps with 6041 reset in 1528 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 35 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:36:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:36:38] [INFO ] Invariant cache hit.
[2023-03-08 21:36:38] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 830/830 places, 800/800 transitions.
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 14 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:36:38] [INFO ] Invariant cache hit.
[2023-03-08 21:36:39] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-08 21:36:39] [INFO ] Invariant cache hit.
[2023-03-08 21:36:39] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-08 21:36:39] [INFO ] Invariant cache hit.
[2023-03-08 21:36:40] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1133 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-08 finished in 13643 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(X((X(p1) U p2)))||p0)) U !X(p1)))'
Support contains 410 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 4 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:36:40] [INFO ] Invariant cache hit.
[2023-03-08 21:36:40] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 21:36:40] [INFO ] Invariant cache hit.
[2023-03-08 21:36:40] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-08 21:36:40] [INFO ] Invariant cache hit.
[2023-03-08 21:36:41] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 161 ms :[p1, (AND (NOT p2) p0 p1), p1, (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1135 ms.
Product exploration explored 100000 steps with 50000 reset in 1131 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 p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 8 factoid took 216 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-COL-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-09 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(G(p0)))'
Support contains 100 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 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 45 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 21:36:44] [INFO ] Computed 130 place invariants in 4 ms
[2023-03-08 21:36:45] [INFO ] Implicit Places using invariants in 808 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 816 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 8 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 869 ms. Remains : 430/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s251 1) (GEQ s312 1) (GEQ s255 1) (GEQ s316 1) (GEQ s243 1) (GEQ s304 1) (GEQ s247 1) (GEQ s308 1) (GEQ s267 1) (GEQ s328 1) (GEQ s271 1) (GEQ...], 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 507 ms.
Product exploration explored 100000 steps with 0 reset in 625 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 500 rows 430 cols
[2023-03-08 21:36:46] [INFO ] Computed 30 place invariants in 7 ms
[2023-03-08 21:36:46] [INFO ] [Real]Absence check using 28 positive place invariants in 48 ms returned sat
[2023-03-08 21:36:46] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-08 21:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:36:48] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2023-03-08 21:36:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:36:48] [INFO ] [Nat]Absence check using 28 positive place invariants in 23 ms returned sat
[2023-03-08 21:36:48] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-08 21:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:36:50] [INFO ] [Nat]Absence check using state equation in 2058 ms returned sat
[2023-03-08 21:36:50] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-08 21:36:51] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-08 21:36:52] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:36:52] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-08 21:36:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1393 ms
[2023-03-08 21:36:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1394 ms
[2023-03-08 21:36:52] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-08 21:36:55] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-08 21:36:55] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-08 21:36:56] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-08 21:36:56] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-08 21:36:56] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-08 21:36:56] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-08 21:36:56] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-08 21:36:56] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-08 21:36:57] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-08 21:36:57] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-08 21:36:57] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-08 21:36:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1671 ms
[2023-03-08 21:36:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1671 ms
[2023-03-08 21:36:58] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-08 21:36:58] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-08 21:36:58] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-08 21:36:58] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2023-03-08 21:36:58] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:36:58] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-08 21:36:59] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-08 21:36:59] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-08 21:36:59] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2023-03-08 21:36:59] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-08 21:36:59] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-08 21:36:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1627 ms
[2023-03-08 21:36:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1628 ms
[2023-03-08 21:36:59] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-08 21:37:00] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-08 21:37:00] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-08 21:37:00] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-08 21:37:00] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-08 21:37:00] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-08 21:37:00] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-08 21:37:01] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-08 21:37:01] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-08 21:37:01] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-08 21:37:01] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-08 21:37:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1803 ms
[2023-03-08 21:37:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1803 ms
[2023-03-08 21:37:01] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-08 21:37:02] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-08 21:37:03] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 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:251)
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 21:37:03] [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)
Support contains 100 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 21:37:03] [INFO ] Invariant cache hit.
[2023-03-08 21:37:03] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-08 21:37:03] [INFO ] Invariant cache hit.
[2023-03-08 21:37:04] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-03-08 21:37:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:37:04] [INFO ] Invariant cache hit.
[2023-03-08 21:37:05] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1595 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 12 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 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-08 21:37:05] [INFO ] Invariant cache hit.
[2023-03-08 21:37:05] [INFO ] [Real]Absence check using 28 positive place invariants in 30 ms returned sat
[2023-03-08 21:37:05] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-08 21:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:37:06] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2023-03-08 21:37:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:37:07] [INFO ] [Nat]Absence check using 28 positive place invariants in 32 ms returned sat
[2023-03-08 21:37:07] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-08 21:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:37:09] [INFO ] [Nat]Absence check using state equation in 1760 ms returned sat
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-08 21:37:09] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-08 21:37:10] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-08 21:37:10] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-08 21:37:10] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-08 21:37:10] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-08 21:37:10] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1479 ms
[2023-03-08 21:37:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1479 ms
[2023-03-08 21:37:10] [INFO ] Computed and/alt/rep : 400/2000/400 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-08 21:37:13] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-08 21:37:14] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-08 21:37:14] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-08 21:37:14] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2023-03-08 21:37:14] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-08 21:37:14] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-08 21:37:14] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1681 ms
[2023-03-08 21:37:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1681 ms
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-08 21:37:15] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-08 21:37:16] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-08 21:37:16] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-08 21:37:16] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-08 21:37:16] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-08 21:37:16] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-08 21:37:16] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1595 ms
[2023-03-08 21:37:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1595 ms
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-08 21:37:17] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-08 21:37:18] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-08 21:37:18] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-08 21:37:18] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-08 21:37:18] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-08 21:37:19] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-08 21:37:19] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-08 21:37:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2401 ms
[2023-03-08 21:37:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2401 ms
[2023-03-08 21:37:19] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-08 21:37:20] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-08 21:37:21] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-08 21:37:21] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-08 21:37:21] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2023-03-08 21:37:21] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1624 ms
[2023-03-08 21:37:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1624 ms
[2023-03-08 21:37:21] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-08 21:37:22] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 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 21:37:22] [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 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Product exploration explored 100000 steps with 0 reset in 581 ms.
Support contains 100 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 6 ms. Remains 430 /430 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-08 21:37:23] [INFO ] Invariant cache hit.
[2023-03-08 21:37:23] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-08 21:37:23] [INFO ] Invariant cache hit.
[2023-03-08 21:37:24] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2023-03-08 21:37:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:37:24] [INFO ] Invariant cache hit.
[2023-03-08 21:37:24] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1674 ms. Remains : 430/430 places, 500/500 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-11 finished in 40828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(!p0)))||(F(!p1)&&X((p2 U (!p1||G(p2)))))))'
Support contains 400 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 4 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 21:37:24] [INFO ] Computed 130 place invariants in 9 ms
[2023-03-08 21:37:25] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-08 21:37:25] [INFO ] Invariant cache hit.
[2023-03-08 21:37:25] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2023-03-08 21:37:25] [INFO ] Invariant cache hit.
[2023-03-08 21:37:26] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1440 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), p0]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(OR (AND (GEQ s202 1) (GEQ s522 1) (GEQ s532 1) (GEQ s542 1) (GEQ s552 1) (GEQ s562 1) (GEQ s572 1) (GEQ s582 1) (GEQ s592 1) (GEQ s602 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1243 ms.
Product exploration explored 100000 steps with 50000 reset in 1280 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 p1) p2 (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p2))))
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-12 finished in 4363 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) U X((p1 U G(!p2)))))'
Support contains 510 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 6 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:37:29] [INFO ] Invariant cache hit.
[2023-03-08 21:37:29] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-08 21:37:29] [INFO ] Invariant cache hit.
[2023-03-08 21:37:29] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2023-03-08 21:37:29] [INFO ] Invariant cache hit.
[2023-03-08 21:37:30] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1065 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p2 (NOT p1)), p2, (NOT p0), (AND (NOT p0) p2 p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6016 reset in 752 ms.
Product exploration explored 100000 steps with 6016 reset in 777 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) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 497 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 6932 steps, including 2 resets, run visited all 6 properties in 43 ms. (steps per millisecond=161 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 512 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-08 21:37:33] [INFO ] Invariant cache hit.
[2023-03-08 21:37:34] [INFO ] [Real]Absence check using 29 positive place invariants in 18 ms returned sat
[2023-03-08 21:37:34] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 188 ms returned sat
[2023-03-08 21:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:37:37] [INFO ] [Real]Absence check using state equation in 2695 ms returned sat
[2023-03-08 21:37:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:37:37] [INFO ] [Nat]Absence check using 29 positive place invariants in 20 ms returned sat
[2023-03-08 21:37:38] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 161 ms returned sat
[2023-03-08 21:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:37:40] [INFO ] [Nat]Absence check using state equation in 2223 ms returned sat
[2023-03-08 21:37:40] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 41 ms.
[2023-03-08 21:37:44] [INFO ] Added : 360 causal constraints over 72 iterations in 4449 ms. Result :sat
Could not prove EG p2
Support contains 510 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 3 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:37:44] [INFO ] Invariant cache hit.
[2023-03-08 21:37:44] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-08 21:37:44] [INFO ] Invariant cache hit.
[2023-03-08 21:37:45] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-08 21:37:45] [INFO ] Invariant cache hit.
[2023-03-08 21:37:45] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1090 ms. Remains : 830/830 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 (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 503 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 678 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 599 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-08 21:37:47] [INFO ] Invariant cache hit.
[2023-03-08 21:37:48] [INFO ] [Real]Absence check using 29 positive place invariants in 17 ms returned sat
[2023-03-08 21:37:48] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 197 ms returned sat
[2023-03-08 21:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:37:51] [INFO ] [Real]Absence check using state equation in 2596 ms returned sat
[2023-03-08 21:37:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:37:51] [INFO ] [Nat]Absence check using 29 positive place invariants in 64 ms returned sat
[2023-03-08 21:37:51] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 159 ms returned sat
[2023-03-08 21:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:37:54] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2023-03-08 21:37:54] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 39 ms.
[2023-03-08 21:37:58] [INFO ] Added : 360 causal constraints over 72 iterations in 4464 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 6030 reset in 777 ms.
Product exploration explored 100000 steps with 6023 reset in 791 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 23 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:38:00] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:38:00] [INFO ] Invariant cache hit.
[2023-03-08 21:38:01] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 510 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 4 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:38:01] [INFO ] Invariant cache hit.
[2023-03-08 21:38:01] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 21:38:01] [INFO ] Invariant cache hit.
[2023-03-08 21:38:01] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-03-08 21:38:01] [INFO ] Invariant cache hit.
[2023-03-08 21:38:02] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1069 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 32868 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(((p1 U p2)&&p0))||G(!p1))))'
Support contains 200 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 6 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:38:02] [INFO ] Invariant cache hit.
[2023-03-08 21:38:02] [INFO ] Implicit Places using invariants in 646 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 661 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 4 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 672 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(OR (GEQ s161 1) (GEQ s157 1) (GEQ s169 1) (GEQ s165 1) (GEQ s177 1) (GEQ s173 1) (GEQ s185 1) (GEQ s181 1) (GEQ s120 1) (GEQ s193 1) (GEQ s124 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 587 ms.
Product exploration explored 100000 steps with 0 reset in 702 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 p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 347 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 800 rows 730 cols
[2023-03-08 21:38:05] [INFO ] Computed 30 place invariants in 14 ms
[2023-03-08 21:38:05] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (G (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 449 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 61 ms :[true, p1, p1]
Support contains 100 out of 730 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:38:06] [INFO ] Invariant cache hit.
[2023-03-08 21:38:06] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-08 21:38:06] [INFO ] Invariant cache hit.
[2023-03-08 21:38:08] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2023-03-08 21:38:08] [INFO ] Invariant cache hit.
[2023-03-08 21:38:09] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2922 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 : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, p1, p1]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 58 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 71 ms :[true, p1, p1]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-14 finished in 7763 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-COL-10-LTLFireability-01
Stuttering acceptance computed with spot in 58 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 31 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 21:38:10] [INFO ] Computed 130 place invariants in 8 ms
[2023-03-08 21:38:10] [INFO ] Implicit Places using invariants in 415 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 445 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 11 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 487 ms. Remains : 530/830 places, 600/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-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 (GEQ s1 1) (GEQ s320 1)) (AND (GEQ s60 1) (GEQ s326 1)) (AND (GEQ s36 1) (GEQ s323 1)) (AND (GEQ s74 1) (GEQ s327 1)) (AND (GEQ s15 1) (GEQ s3...], 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 8214 reset in 668 ms.
Product exploration explored 100000 steps with 8200 reset in 707 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 102 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 31 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 97 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 29 ms :[(NOT p0)]
// Phase 1: matrix 600 rows 530 cols
[2023-03-08 21:38:12] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-08 21:38:13] [INFO ] [Real]Absence check using 28 positive place invariants in 71 ms returned sat
[2023-03-08 21:38:13] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-08 21:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:38:15] [INFO ] [Real]Absence check using state equation in 1866 ms returned sat
[2023-03-08 21:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:38:16] [INFO ] [Nat]Absence check using 28 positive place invariants in 37 ms returned sat
[2023-03-08 21:38:16] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-08 21:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:38:17] [INFO ] [Nat]Absence check using state equation in 1389 ms returned sat
[2023-03-08 21:38:17] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-08 21:38:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-08 21:38:17] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-08 21:38:18] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-08 21:38:18] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-08 21:38:18] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-08 21:38:18] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-08 21:38:18] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-08 21:38:19] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-08 21:38:19] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-08 21:38:19] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-08 21:38:19] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-08 21:38:19] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-08 21:38:19] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-08 21:38:20] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-08 21:38:20] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-08 21:38:20] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2023-03-08 21:38:20] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-08 21:38:20] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-08 21:38:20] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-08 21:38:21] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-08 21:38:21] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-08 21:38:21] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-08 21:38:21] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-08 21:38:21] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-08 21:38:21] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-08 21:38:22] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-08 21:38:22] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-08 21:38:22] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2023-03-08 21:38:22] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-08 21:38:22] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-08 21:38:22] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-08 21:38:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-08 21:38:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7276 ms
[2023-03-08 21:38:24] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 7276 ms
[2023-03-08 21:38:24] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 8 ms to minimize.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-08 21:38:29] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-08 21:38:30] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-08 21:38:30] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-08 21:38:30] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 1226 ms
[2023-03-08 21:38:30] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 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:251)
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 21:38:30] [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)
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 8 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-08 21:38:30] [INFO ] Invariant cache hit.
[2023-03-08 21:38:30] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-08 21:38:30] [INFO ] Invariant cache hit.
[2023-03-08 21:38:32] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2023-03-08 21:38:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:38:32] [INFO ] Invariant cache hit.
[2023-03-08 21:38:32] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2051 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 88 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 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
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)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-08 21:38:32] [INFO ] Invariant cache hit.
[2023-03-08 21:38:33] [INFO ] [Real]Absence check using 28 positive place invariants in 75 ms returned sat
[2023-03-08 21:38:33] [INFO ] [Real]Absence check using 28 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-08 21:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:38:36] [INFO ] [Real]Absence check using state equation in 2570 ms returned sat
[2023-03-08 21:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:38:37] [INFO ] [Nat]Absence check using 28 positive place invariants in 40 ms returned sat
[2023-03-08 21:38:37] [INFO ] [Nat]Absence check using 28 positive and 2 generalized place invariants in 37 ms returned sat
[2023-03-08 21:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:38:39] [INFO ] [Nat]Absence check using state equation in 1754 ms returned sat
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 3 ms to minimize.
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-08 21:38:39] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-08 21:38:40] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-08 21:38:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-08 21:38:40] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-08 21:38:40] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 21:38:40] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1326 ms
[2023-03-08 21:38:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1327 ms
[2023-03-08 21:38:40] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-08 21:38:42] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-08 21:38:42] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-08 21:38:43] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1467 ms
[2023-03-08 21:38:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1467 ms
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-08 21:38:44] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1398 ms
[2023-03-08 21:38:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1398 ms
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-08 21:38:45] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-08 21:38:46] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1229 ms
[2023-03-08 21:38:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1229 ms
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-08 21:38:47] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1206 ms
[2023-03-08 21:38:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1207 ms
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-08 21:38:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-08 21:38:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-08 21:38:49] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 21:38:49] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-08 21:38:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-08 21:38:50] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-08 21:38:50] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-08 21:38:50] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-08 21:38:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2203 ms
[2023-03-08 21:38:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2204 ms
[2023-03-08 21:38:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-08 21:38:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-08 21:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 760 ms
[2023-03-08 21:38:51] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 0 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 21:38:51] [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 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8192 reset in 703 ms.
Product exploration explored 100000 steps with 8210 reset in 704 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 8 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-08 21:38:53] [INFO ] Invariant cache hit.
[2023-03-08 21:38:53] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-08 21:38:53] [INFO ] Invariant cache hit.
[2023-03-08 21:38:54] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2023-03-08 21:38:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:38:54] [INFO ] Invariant cache hit.
[2023-03-08 21:38:54] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1857 ms. Remains : 530/530 places, 600/600 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-01 finished in 45087 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(F((G((F(!p1)&&F(G(!p2))))||p0))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-10-LTLFireability-08
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 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 21:38:55] [INFO ] Computed 130 place invariants in 6 ms
[2023-03-08 21:38:55] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-08 21:38:55] [INFO ] Invariant cache hit.
[2023-03-08 21:38:56] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-08 21:38:56] [INFO ] Invariant cache hit.
[2023-03-08 21:38:56] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1121 ms. Remains : 830/830 places, 800/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6023 reset in 1705 ms.
Product exploration explored 100000 steps with 6023 reset in 1724 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 (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:39:00] [INFO ] Invariant cache hit.
[2023-03-08 21:39:01] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
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 9 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:39:01] [INFO ] Invariant cache hit.
[2023-03-08 21:39:01] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 21:39:01] [INFO ] Invariant cache hit.
[2023-03-08 21:39:02] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2023-03-08 21:39:02] [INFO ] Invariant cache hit.
[2023-03-08 21:39:02] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1143 ms. Remains : 830/830 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 (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 754 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=150 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 6020 reset in 1472 ms.
Product exploration explored 100000 steps with 6035 reset in 1494 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 310 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_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.
[2023-03-08 21:39:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:39:07] [INFO ] Invariant cache hit.
[2023-03-08 21:39:07] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 830/830 places, 800/800 transitions.
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 7 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:39:07] [INFO ] Invariant cache hit.
[2023-03-08 21:39:07] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-08 21:39:07] [INFO ] Invariant cache hit.
[2023-03-08 21:39:08] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-03-08 21:39:08] [INFO ] Invariant cache hit.
[2023-03-08 21:39:08] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1101 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-08 finished in 13387 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)))'
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) U X((p1 U G(!p2)))))'
Found a Lengthening insensitive property : DatabaseWithMutex-COL-10-LTLFireability-13
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p2 (NOT p1)), p2, (NOT p0), (AND (NOT p0) p2 p1)]
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:39:08] [INFO ] Invariant cache hit.
[2023-03-08 21:39:09] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-08 21:39:09] [INFO ] Invariant cache hit.
[2023-03-08 21:39:09] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-08 21:39:09] [INFO ] Invariant cache hit.
[2023-03-08 21:39:09] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1093 ms. Remains : 830/830 places, 800/800 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s620 1)) (AND (GEQ s60 1) (GEQ s626 1)) (AND (GEQ s36 1) (GEQ s623 1)) (AND (GEQ s74 1) (GEQ s627 1)) (AND (GEQ s15 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6035 reset in 753 ms.
Product exploration explored 100000 steps with 6000 reset in 778 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) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 443 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 2605 steps, including 0 resets, run visited all 6 properties in 19 ms. (steps per millisecond=137 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 582 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-08 21:39:13] [INFO ] Invariant cache hit.
[2023-03-08 21:39:13] [INFO ] [Real]Absence check using 29 positive place invariants in 19 ms returned sat
[2023-03-08 21:39:14] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 191 ms returned sat
[2023-03-08 21:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:39:16] [INFO ] [Real]Absence check using state equation in 2540 ms returned sat
[2023-03-08 21:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:39:17] [INFO ] [Nat]Absence check using 29 positive place invariants in 19 ms returned sat
[2023-03-08 21:39:17] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 160 ms returned sat
[2023-03-08 21:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:39:19] [INFO ] [Nat]Absence check using state equation in 2133 ms returned sat
[2023-03-08 21:39:19] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 38 ms.
[2023-03-08 21:39:23] [INFO ] Added : 360 causal constraints over 72 iterations in 4431 ms. Result :sat
Could not prove EG p2
Support contains 510 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 3 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:39:24] [INFO ] Invariant cache hit.
[2023-03-08 21:39:24] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-08 21:39:24] [INFO ] Invariant cache hit.
[2023-03-08 21:39:24] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-08 21:39:24] [INFO ] Invariant cache hit.
[2023-03-08 21:39:25] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1105 ms. Remains : 830/830 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 (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 506 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Finished random walk after 322 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 541 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
[2023-03-08 21:39:26] [INFO ] Invariant cache hit.
[2023-03-08 21:39:27] [INFO ] [Real]Absence check using 29 positive place invariants in 19 ms returned sat
[2023-03-08 21:39:27] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 193 ms returned sat
[2023-03-08 21:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:39:30] [INFO ] [Real]Absence check using state equation in 2549 ms returned sat
[2023-03-08 21:39:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:39:30] [INFO ] [Nat]Absence check using 29 positive place invariants in 19 ms returned sat
[2023-03-08 21:39:30] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 157 ms returned sat
[2023-03-08 21:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:39:33] [INFO ] [Nat]Absence check using state equation in 2110 ms returned sat
[2023-03-08 21:39:33] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 49 ms.
[2023-03-08 21:39:37] [INFO ] Added : 360 causal constraints over 72 iterations in 4455 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 6018 reset in 772 ms.
Product exploration explored 100000 steps with 6017 reset in 785 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1) p2), p2, (NOT p0), (AND (NOT p0) p1 p2)]
Support contains 510 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:39:39] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:39:39] [INFO ] Invariant cache hit.
[2023-03-08 21:39:39] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 510 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 3 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-08 21:39:39] [INFO ] Invariant cache hit.
[2023-03-08 21:39:40] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 21:39:40] [INFO ] Invariant cache hit.
[2023-03-08 21:39:40] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2023-03-08 21:39:40] [INFO ] Invariant cache hit.
[2023-03-08 21:39:41] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1122 ms. Remains : 830/830 places, 800/800 transitions.
Treatment of property DatabaseWithMutex-COL-10-LTLFireability-13 finished in 32490 ms.
[2023-03-08 21:39:41] [INFO ] Flatten gal took : 140 ms
[2023-03-08 21:39:41] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 28 ms.
[2023-03-08 21:39:41] [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 272041 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DatabaseWithMutex-COL-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA DatabaseWithMutex-COL-10-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-10-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-10-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678311705428

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
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: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 13 (type EXCL) for 12 DatabaseWithMutex-COL-10-LTLFireability-11
lola: time limit : 597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for DatabaseWithMutex-COL-10-LTLFireability-11
lola: result : false
lola: markings : 31
lola: fired transitions : 32
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DatabaseWithMutex-COL-10-LTLFireability-05
lola: time limit : 716 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DatabaseWithMutex-COL-10-LTLFireability-05
lola: result : false
lola: markings : 86
lola: fired transitions : 87
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DatabaseWithMutex-COL-10-LTLFireability-01
lola: time limit : 895 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/895 7/32 DatabaseWithMutex-COL-10-LTLFireability-01 552605 m, 110521 m/sec, 641971 t fired, .

Time elapsed: 23 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/895 13/32 DatabaseWithMutex-COL-10-LTLFireability-01 1132158 m, 115910 m/sec, 1337815 t fired, .

Time elapsed: 28 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/895 20/32 DatabaseWithMutex-COL-10-LTLFireability-01 1716354 m, 116839 m/sec, 2027901 t fired, .

Time elapsed: 33 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/895 26/32 DatabaseWithMutex-COL-10-LTLFireability-01 2299224 m, 116574 m/sec, 2716224 t fired, .

Time elapsed: 38 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 1 (type EXCL) for DatabaseWithMutex-COL-10-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 43 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 16 (type EXCL) for 15 DatabaseWithMutex-COL-10-LTLFireability-13
lola: time limit : 1185 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 5/1185 7/32 DatabaseWithMutex-COL-10-LTLFireability-13 591956 m, 118391 m/sec, 700537 t fired, .

Time elapsed: 48 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 10/1185 14/32 DatabaseWithMutex-COL-10-LTLFireability-13 1178304 m, 117269 m/sec, 1391898 t fired, .

Time elapsed: 53 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 15/1185 20/32 DatabaseWithMutex-COL-10-LTLFireability-13 1765095 m, 117358 m/sec, 2084457 t fired, .

Time elapsed: 58 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 20/1185 27/32 DatabaseWithMutex-COL-10-LTLFireability-13 2350061 m, 116993 m/sec, 2777105 t fired, .

Time elapsed: 63 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 16 (type EXCL) for DatabaseWithMutex-COL-10-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 68 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 10 (type EXCL) for 9 DatabaseWithMutex-COL-10-LTLFireability-08
lola: time limit : 1766 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1766 4/32 DatabaseWithMutex-COL-10-LTLFireability-08 271033 m, 54206 m/sec, 315007 t fired, .

Time elapsed: 73 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1766 7/32 DatabaseWithMutex-COL-10-LTLFireability-08 540086 m, 53810 m/sec, 627788 t fired, .

Time elapsed: 78 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1766 10/32 DatabaseWithMutex-COL-10-LTLFireability-08 806294 m, 53241 m/sec, 947920 t fired, .

Time elapsed: 83 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1766 13/32 DatabaseWithMutex-COL-10-LTLFireability-08 1072661 m, 53273 m/sec, 1269191 t fired, .

Time elapsed: 88 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1766 16/32 DatabaseWithMutex-COL-10-LTLFireability-08 1341249 m, 53717 m/sec, 1580461 t fired, .

Time elapsed: 93 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1766 19/32 DatabaseWithMutex-COL-10-LTLFireability-08 1606835 m, 53117 m/sec, 1900826 t fired, .

Time elapsed: 98 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1766 22/32 DatabaseWithMutex-COL-10-LTLFireability-08 1874815 m, 53596 m/sec, 2211460 t fired, .

Time elapsed: 103 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1766 25/32 DatabaseWithMutex-COL-10-LTLFireability-08 2140222 m, 53081 m/sec, 2531530 t fired, .

Time elapsed: 108 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1766 27/32 DatabaseWithMutex-COL-10-LTLFireability-08 2406173 m, 53190 m/sec, 2851500 t fired, .

Time elapsed: 113 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1766 30/32 DatabaseWithMutex-COL-10-LTLFireability-08 2674182 m, 53601 m/sec, 3162154 t fired, .

Time elapsed: 118 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 10 (type EXCL) for DatabaseWithMutex-COL-10-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DatabaseWithMutex-COL-10-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DatabaseWithMutex-COL-10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
DatabaseWithMutex-COL-10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 123 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 7 (type EXCL) for 6 DatabaseWithMutex-COL-10-LTLFireability-07
lola: time limit : 3477 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DatabaseWithMutex-COL-10-LTLFireability-07
lola: result : false
lola: markings : 15155
lola: fired transitions : 16638
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 6

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DatabaseWithMutex-COL-10-LTLFireability-01: LTL unknown AGGR
DatabaseWithMutex-COL-10-LTLFireability-05: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-07: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-08: LTL unknown AGGR
DatabaseWithMutex-COL-10-LTLFireability-11: LTL false LTL model checker
DatabaseWithMutex-COL-10-LTLFireability-13: LTL unknown AGGR


Time elapsed: 123 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-COL-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-COL-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-167814479101036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-10.tgz
mv DatabaseWithMutex-COL-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;