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

About the Execution of LoLa+red for SwimmingPool-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
925.359 26156.00 27821.00 478.20 TFFF?TTFFFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912703000388.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 SwimmingPool-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703000388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.7K Feb 26 03:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 03:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 03:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679186982932

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=SwimmingPool-PT-09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 00:49:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 00:49:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:49:44] [INFO ] Load time of PNML (sax parser for PT used): 16 ms
[2023-03-19 00:49:44] [INFO ] Transformed 9 places.
[2023-03-19 00:49:44] [INFO ] Transformed 7 transitions.
[2023-03-19 00:49:44] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA SwimmingPool-PT-09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:49:44] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 00:49:44] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 00:49:44] [INFO ] Invariant cache hit.
[2023-03-19 00:49:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-19 00:49:44] [INFO ] Invariant cache hit.
[2023-03-19 00:49:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 00:49:45] [INFO ] Flatten gal took : 11 ms
[2023-03-19 00:49:45] [INFO ] Flatten gal took : 3 ms
[2023-03-19 00:49:45] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 546 steps, including 0 resets, run visited all 9 properties in 8 ms. (steps per millisecond=68 )
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' '!(G(F(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 7 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-19 00:49:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:49:45] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 00:49:45] [INFO ] Invariant cache hit.
[2023-03-19 00:49:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 00:49:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:45] [INFO ] Invariant cache hit.
[2023-03-19 00:49:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1)], 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 2711 reset in 182 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-03 finished in 550 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(F(p0))||(!p0&&F(G(p1))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 00:49:45] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 00:49:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 00:49:45] [INFO ] Invariant cache hit.
[2023-03-19 00:49:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 00:49:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:46] [INFO ] Invariant cache hit.
[2023-03-19 00:49:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-04 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) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 167 reset in 134 ms.
Product exploration explored 100000 steps with 122 reset in 135 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) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 359 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 547 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=182 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 00:49:47] [INFO ] Invariant cache hit.
[2023-03-19 00:49:47] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 00:49:47] [INFO ] Invariant cache hit.
[2023-03-19 00:49:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 00:49:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:47] [INFO ] Invariant cache hit.
[2023-03-19 00:49:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 8/8 places, 6/6 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) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 455 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=151 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 180 reset in 101 ms.
Product exploration explored 100000 steps with 168 reset in 88 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 00:49:48] [INFO ] Invariant cache hit.
[2023-03-19 00:49:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 00:49:48] [INFO ] Invariant cache hit.
[2023-03-19 00:49:48] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-19 00:49:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:48] [INFO ] Invariant cache hit.
[2023-03-19 00:49:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property SwimmingPool-PT-09-LTLFireability-04 finished in 2368 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)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 00:49:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:49:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 00:49:48] [INFO ] Invariant cache hit.
[2023-03-19 00:49:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-19 00:49:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:48] [INFO ] Invariant cache hit.
[2023-03-19 00:49:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s5 1)), p0:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15172 reset in 56 ms.
Product exploration explored 100000 steps with 15014 reset in 62 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) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Finished random walk after 273 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=273 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 5 factoid took 256 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 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2023-03-19 00:49:49] [INFO ] Invariant cache hit.
[2023-03-19 00:49:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 00:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:49:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-19 00:49:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:49:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 00:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:49:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 00:49:49] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 00:49:49] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-19 00:49:49] [INFO ] Invariant cache hit.
[2023-03-19 00:49:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-19 00:49:49] [INFO ] Invariant cache hit.
[2023-03-19 00:49:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-19 00:49:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:49] [INFO ] Invariant cache hit.
[2023-03-19 00:49:49] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 7/7 places, 5/5 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)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 31 ms :[(NOT p1)]
Finished random walk after 273 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=273 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
[2023-03-19 00:49:49] [INFO ] Invariant cache hit.
[2023-03-19 00:49:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 00:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:49:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-19 00:49:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:49:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 00:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:49:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-19 00:49:49] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 00:49:49] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15172 reset in 54 ms.
Product exploration explored 100000 steps with 15140 reset in 56 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 4
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-19 00:49:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:49:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 00:49:49] [INFO ] Invariant cache hit.
[2023-03-19 00:49:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 00:49:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 4/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 6/7 places, 4/5 transitions.
Treatment of property SwimmingPool-PT-09-LTLFireability-05 finished in 1721 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((!p0&&(G(F(p1)) U p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:49:50] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s2 1), p1:(AND (GEQ s0 1) (GEQ s7 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-07 finished in 299 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((p0 U G(!p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 114 ms :[p1, p1, true, p1]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-08 finished in 214 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((p0&&F(G(p1)))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s4 1), p1:(AND (LT s2 1) (OR (LT s3 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-09 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(((G(p0) U p0)&&(G(p0)||p1)))||p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 00:49:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:50] [INFO ] Invariant cache hit.
[2023-03-19 00:49:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1)), p2:(GEQ s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Stack based approach found an accepted trace after 32343 steps with 0 reset with depth 32344 and stack size 32054 in 38 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-11 finished in 291 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 X(G(!p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 74 ms :[p1, p1, true]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-12 finished in 165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(F((G(F(!p1))||(!p2&&F(!p1)))))&&p0) U X(G(!p2))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 451 ms :[p2, p2, p2, p2, (AND p2 p1), true, p1, (AND p1 p2), p1]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 7}, { cond=(AND p2 p1), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s7 1)), p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-13 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0||X(X(G(!p1))))))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-19 00:49:51] [INFO ] Invariant cache hit.
[2023-03-19 00:49:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1)), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-14 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 4 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-19 00:49:52] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 00:49:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 00:49:52] [INFO ] Invariant cache hit.
[2023-03-19 00:49:52] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 00:49:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:49:52] [INFO ] Invariant cache hit.
[2023-03-19 00:49:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 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 63 ms.
Product exploration explored 100000 steps with 50000 reset in 50 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 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-09-LTLFireability-15 finished in 388 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(F(p0))||(!p0&&F(G(p1))))))'
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)))'
[2023-03-19 00:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 00:49:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 00:49:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 7 transitions and 20 arcs took 0 ms.
Total runtime 8584 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SwimmingPool-PT-09
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA SwimmingPool-PT-09-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679187009088

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SwimmingPool-PT-09-LTLFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SwimmingPool-PT-09-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SwimmingPool-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 16/32 SwimmingPool-PT-09-LTLFireability-04 2417081 m, 483416 m/sec, 6861681 t fired, .

Time elapsed: 5 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SwimmingPool-PT-09-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
SwimmingPool-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1799 29/32 SwimmingPool-PT-09-LTLFireability-04 4385717 m, 393727 m/sec, 12633595 t fired, .

Time elapsed: 11 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for SwimmingPool-PT-09-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SwimmingPool-PT-09-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
SwimmingPool-PT-09-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 SwimmingPool-PT-09-LTLFireability-05
lola: time limit : 3584 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for SwimmingPool-PT-09-LTLFireability-05
lola: result : true
lola: markings : 49500
lola: fired transitions : 61964
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SwimmingPool-PT-09-LTLFireability-04: LTL unknown AGGR
SwimmingPool-PT-09-LTLFireability-05: LTL true LTL model checker


Time elapsed: 16 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="SwimmingPool-PT-09"
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 SwimmingPool-PT-09, 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 r487-tall-167912703000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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