About the Execution of ITS-Tools for SwimmingPool-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4542.207 | 3600000.00 | 4227011.00 | 6676.50 | FFTTFF?F?FFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545700428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r258-tall-165303545700428
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.9K May 10 09:34 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 1653133308689
Running Version 202205111006
[2022-05-21 11:41:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 11:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 11:41:49] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2022-05-21 11:41:49] [INFO ] Transformed 9 places.
[2022-05-21 11:41:49] [INFO ] Transformed 7 transitions.
[2022-05-21 11:41:49] [INFO ] Parsed PT model containing 9 places and 7 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SwimmingPool-PT-09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-LTLFireability-14 TRUE 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 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:50] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 11:41:50] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:50] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:50] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-21 11:41:50] [INFO ] Flatten gal took : 12 ms
[2022-05-21 11:41:50] [INFO ] Flatten gal took : 2 ms
[2022-05-21 11:41:50] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 684 steps, including 0 resets, run visited all 10 properties in 13 ms. (steps per millisecond=52 )
FORMULA SwimmingPool-PT-09-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((X(p1)&&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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:50] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(GEQ s2 1), p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(AND (GEQ s0 1) (GEQ s7 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9922 reset in 208 ms.
Stack based approach found an accepted trace after 112 steps with 12 reset with depth 16 and stack size 16 in 1 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-00 finished in 663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(G((F(G(p0))&&!(!p0 U p1)))))&&!p0)))'
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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:51] [INFO ] Computed 3 place invariants in 11 ms
[2022-05-21 11:41:51] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, true, true, (OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { 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, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(LT s2 1), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-01 finished in 313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!G(X(X(p0))) U !p0))||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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:41:51] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:51] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s7 1)), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 102 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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 7 states, 14 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-09-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-09-LTLFireability-02 finished in 819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((X(p1)||p0)))))'
Support contains 2 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
[2022-05-21 11:41:52] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:52] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:52] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:52] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 11:41:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), 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:(LT s2 1), p1:(LT s5 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 7945 reset in 129 ms.
Stack based approach found an accepted trace after 1909 steps with 169 reset with depth 57 and stack size 57 in 3 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-04 finished in 363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((G(p1)||X(p2))))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:53] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-21 11:41:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(LT s6 1), p2:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10153 reset in 67 ms.
Product exploration explored 100000 steps with 10903 reset in 156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 181 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:41:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-21 11:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 11:41:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 11:41:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-21 11:41:54] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 11:41:54] [INFO ] Added : 4 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT 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 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:54] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-21 11:41:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 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 p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 181 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:41:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:41:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-21 11:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 11:41:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 11:41:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 11:41:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-21 11:41:55] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 11:41:55] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 8826 reset in 139 ms.
Product exploration explored 100000 steps with 8512 reset in 128 ms.
Built C files in :
/tmp/ltsmin15103676133447730279
[2022-05-21 11:41:55] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 11:41:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:41:55] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 11:41:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:41:55] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 11:41:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:41:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15103676133447730279
Running compilation step : cd /tmp/ltsmin15103676133447730279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin15103676133447730279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15103676133447730279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4197567805656929508.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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
Applied a total of 2 rules in 8 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:42:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:42:10] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:42:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:42:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-21 11:42:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:42:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:42:10] [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 1 iterations. Remains : 8/9 places, 6/7 transitions.
Built C files in :
/tmp/ltsmin1496036565178766584
[2022-05-21 11:42:11] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 11:42:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:42:11] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 11:42:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:42:11] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 11:42:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:42:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1496036565178766584
Running compilation step : cd /tmp/ltsmin1496036565178766584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin1496036565178766584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1496036565178766584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7167105718455181059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 11:42:26] [INFO ] Flatten gal took : 2 ms
[2022-05-21 11:42:26] [INFO ] Flatten gal took : 1 ms
[2022-05-21 11:42:26] [INFO ] Time to serialize gal into /tmp/LTL11272337617771463818.gal : 2 ms
[2022-05-21 11:42:26] [INFO ] Time to serialize properties into /tmp/LTL4117220580448742040.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11272337617771463818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4117220580448742040.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1127233...267
Read 1 LTL properties
Checking formula 0 : !(((F("((Entered<1)||(Cabins<1))"))&&(G(F((G("(Out<1)"))||(X("((WaitBag>=1)&&(Bags>=1))")))))))
Formula 0 simplified : !(F"((Entered<1)||(Cabins<1))" & GF(G"(Out<1)" | X"((WaitBag>=1)&&(Bags>=1))"))
Detected timeout of ITS tools.
[2022-05-21 11:42:41] [INFO ] Flatten gal took : 1 ms
[2022-05-21 11:42:41] [INFO ] Applying decomposition
[2022-05-21 11:42:41] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16128295765358518025.txt' '-o' '/tmp/graph16128295765358518025.bin' '-w' '/tmp/graph16128295765358518025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16128295765358518025.bin' '-l' '-1' '-v' '-w' '/tmp/graph16128295765358518025.weights' '-q' '0' '-e' '0.001'
[2022-05-21 11:42:41] [INFO ] Decomposing Gal with order
[2022-05-21 11:42:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 11:42:41] [INFO ] Flatten gal took : 49 ms
[2022-05-21 11:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 11:42:41] [INFO ] Time to serialize gal into /tmp/LTL4657142966551201465.gal : 1 ms
[2022-05-21 11:42:41] [INFO ] Time to serialize properties into /tmp/LTL18224093151893321905.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4657142966551201465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18224093151893321905.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4657142...246
Read 1 LTL properties
Checking formula 0 : !(((F("((u1.Entered<1)||(u2.Cabins<1))"))&&(G(F((G("(u1.Out<1)"))||(X("((u1.WaitBag>=1)&&(u0.Bags>=1))")))))))
Formula 0 simplified : !(F"((u1.Entered<1)||(u2.Cabins<1))" & GF(G"(u1.Out<1)" | X"((u1.WaitBag>=1)&&(u0.Bags>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10077120408514413203
[2022-05-21 11:42:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10077120408514413203
Running compilation step : cd /tmp/ltsmin10077120408514413203;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin10077120408514413203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin10077120408514413203;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-09-LTLFireability-06 finished in 78467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((F(p0)&&X(p0))))||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 10 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 11:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:43:11] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 11:43:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 11:43:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 11:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:43:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-07 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&((G(p0) U G(F(p1)))||p2))))'
Support contains 4 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
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
[2022-05-21 11:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:43:11] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-21 11:43:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:43:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s5 1), p2:(GEQ s3 1), p1:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 29537 reset in 77 ms.
Product exploration explored 100000 steps with 29565 reset in 128 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Finished random walk after 364 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) p2)), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 394 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:43:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 11:43:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 11:43:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 11:43:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 11:43:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 11:43:13] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 11:43:13] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:43:13] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:13] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-21 11:43:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Finished random walk after 501 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) p2)), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 447 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 11:43:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 11:43:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 11:43:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 11:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 11:43:14] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 11:43:14] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 11:43:14] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 29781 reset in 74 ms.
Product exploration explored 100000 steps with 29632 reset in 62 ms.
Built C files in :
/tmp/ltsmin18322500272821075543
[2022-05-21 11:43:15] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 11:43:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:43:15] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 11:43:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:43:15] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 11:43:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:43:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18322500272821075543
Running compilation step : cd /tmp/ltsmin18322500272821075543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin18322500272821075543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18322500272821075543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1758746668583705799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:30] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 11:43:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-21 11:43:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 11:43:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:43:30] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin7530185169033167868
[2022-05-21 11:43:30] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 11:43:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:43:30] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 11:43:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:43:30] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 11:43:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:43:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7530185169033167868
Running compilation step : cd /tmp/ltsmin7530185169033167868;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 63 ms.
Running link step : cd /tmp/ltsmin7530185169033167868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7530185169033167868;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3117457171361206104.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 11:43:45] [INFO ] Flatten gal took : 3 ms
[2022-05-21 11:43:45] [INFO ] Flatten gal took : 2 ms
[2022-05-21 11:43:45] [INFO ] Time to serialize gal into /tmp/LTL4968573260465971746.gal : 0 ms
[2022-05-21 11:43:45] [INFO ] Time to serialize properties into /tmp/LTL3508801158096517491.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4968573260465971746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3508801158096517491.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4968573...266
Read 1 LTL properties
Checking formula 0 : !((G((F("(Out>=1)"))&&(((G("(Out>=1)"))U(G(F("((WaitBag>=1)&&(Bags>=1))"))))||("(Dress>=1)")))))
Formula 0 simplified : !G(F"(Out>=1)" & ("(Dress>=1)" | (G"(Out>=1)" U GF"((WaitBag>=1)&&(Bags>=1))")))
Detected timeout of ITS tools.
[2022-05-21 11:44:00] [INFO ] Flatten gal took : 3 ms
[2022-05-21 11:44:00] [INFO ] Applying decomposition
[2022-05-21 11:44:00] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15072484440100594239.txt' '-o' '/tmp/graph15072484440100594239.bin' '-w' '/tmp/graph15072484440100594239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15072484440100594239.bin' '-l' '-1' '-v' '-w' '/tmp/graph15072484440100594239.weights' '-q' '0' '-e' '0.001'
[2022-05-21 11:44:00] [INFO ] Decomposing Gal with order
[2022-05-21 11:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 11:44:00] [INFO ] Flatten gal took : 2 ms
[2022-05-21 11:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 11:44:00] [INFO ] Time to serialize gal into /tmp/LTL4623237289512001371.gal : 1 ms
[2022-05-21 11:44:00] [INFO ] Time to serialize properties into /tmp/LTL7668296256212920470.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4623237289512001371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7668296256212920470.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4623237...245
Read 1 LTL properties
Checking formula 0 : !((G((F("(u2.Out>=1)"))&&(((G("(u2.Out>=1)"))U(G(F("((u0.WaitBag>=1)&&(u1.Bags>=1))"))))||("(u1.Dress>=1)")))))
Formula 0 simplified : !G(F"(u2.Out>=1)" & ("(u1.Dress>=1)" | (G"(u2.Out>=1)" U GF"((u0.WaitBag>=1)&&(u1.Bags>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5610556432670404012
[2022-05-21 11:44:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5610556432670404012
Running compilation step : cd /tmp/ltsmin5610556432670404012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin5610556432670404012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5610556432670404012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&(([]((LTLAPp0==true)) U [](<>((LTLAPp1==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-09-LTLFireability-08 finished in 78797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U X(p1)) U (!(G(p1) U !p1)&&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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:30] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND p1 p2), true, (AND p1 p2)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LT s4 1), p2:(AND (GEQ s1 1) (GEQ s8 1)), p1:(AND (GEQ s1 1) (GEQ s8 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-09 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1 U p2)))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:30] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 11:44:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s3 1) (GEQ s7 1)), p1:(LT s6 1), p0:(OR (AND (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s1 1) (GEQ s8 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, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-11 finished in 172 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:30] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-21 11:44:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:44:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-12 finished in 179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:44:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:31] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:44:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 11:44:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 11:44:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:31] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s4 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 8 reset in 61 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SwimmingPool-PT-09-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-09-LTLFireability-13 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !X((G((p1 U p2))&&!p1)))))'
Support contains 5 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
[2022-05-21 11:44:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:31] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 11:44:31] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 11:44:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 11:44:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p0) p2)]
Running random walk in product with property : SwimmingPool-PT-09-LTLFireability-15 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=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1)), p1:(AND (GEQ s3 1) (GEQ s7 1)), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 46 ms.
Product exploration explored 100000 steps with 33333 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) p2))))
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-09-LTLFireability-15 finished in 630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((G(p1)||X(p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&((G(p0) U G(F(p1)))||p2))))'
[2022-05-21 11:44:32] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14063589931532232971
[2022-05-21 11:44:32] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 11:44:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:44:32] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 11:44:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:44:32] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 11:44:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 11:44:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14063589931532232971
Running compilation step : cd /tmp/ltsmin14063589931532232971;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 11:44:32] [INFO ] Applying decomposition
[2022-05-21 11:44:32] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3340707586634765880.txt' '-o' '/tmp/graph3340707586634765880.bin' '-w' '/tmp/graph3340707586634765880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3340707586634765880.bin' '-l' '-1' '-v' '-w' '/tmp/graph3340707586634765880.weights' '-q' '0' '-e' '0.001'
[2022-05-21 11:44:32] [INFO ] Decomposing Gal with order
[2022-05-21 11:44:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 11:44:32] [INFO ] Flatten gal took : 1 ms
[2022-05-21 11:44:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 11:44:32] [INFO ] Time to serialize gal into /tmp/LTLFireability3127694469729951659.gal : 1 ms
[2022-05-21 11:44:32] [INFO ] Time to serialize properties into /tmp/LTLFireability339429255600799471.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3127694469729951659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability339429255600799471.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 2 LTL properties
Checking formula 0 : !(((F("((u0.Entered<1)||(u1.Cabins<1))"))&&(G(F((G("(u0.Out<1)"))||(X("((u1.WaitBag>=1)&&(u2.Bags>=1))")))))))
Formula 0 simplified : !(F"((u0.Entered<1)||(u1.Cabins<1))" & GF(G"(u0.Out<1)" | X"((u1.WaitBag>=1)&&(u2.Bags>=1))"))
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin14063589931532232971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14063589931532232971;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: (<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||X((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.003: "(<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.025: State length is 10, there are 17 groups
pins2lts-mc-linux64( 0/ 8), 0.025: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.025: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.025: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.025: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.046: [Blue] ~67 levels ~960 states ~1056 transitions
pins2lts-mc-linux64( 1/ 8), 0.056: [Blue] ~157 levels ~1920 states ~2512 transitions
pins2lts-mc-linux64( 1/ 8), 0.080: [Blue] ~182 levels ~3840 states ~6168 transitions
pins2lts-mc-linux64( 7/ 8), 0.107: [Blue] ~192 levels ~7680 states ~15704 transitions
pins2lts-mc-linux64( 7/ 8), 0.155: [Blue] ~192 levels ~15360 states ~32520 transitions
pins2lts-mc-linux64( 7/ 8), 0.253: [Blue] ~214 levels ~30720 states ~63808 transitions
pins2lts-mc-linux64( 7/ 8), 0.433: [Blue] ~251 levels ~61440 states ~141952 transitions
pins2lts-mc-linux64( 7/ 8), 0.700: [Blue] ~283 levels ~122880 states ~293128 transitions
pins2lts-mc-linux64( 7/ 8), 1.158: [Blue] ~288 levels ~245760 states ~606392 transitions
pins2lts-mc-linux64( 6/ 8), 1.704: [Blue] ~597 levels ~491520 states ~1442728 transitions
pins2lts-mc-linux64( 6/ 8), 2.260: [Blue] ~688 levels ~983040 states ~2908856 transitions
pins2lts-mc-linux64( 2/ 8), 3.071: [Blue] ~751 levels ~1966080 states ~4884376 transitions
pins2lts-mc-linux64( 7/ 8), 4.386: [Blue] ~404 levels ~3932160 states ~10777632 transitions
pins2lts-mc-linux64( 4/ 8), 6.820: [Blue] ~420 levels ~7864320 states ~22236496 transitions
pins2lts-mc-linux64( 4/ 8), 12.156: [Blue] ~467 levels ~15728640 states ~45319496 transitions
pins2lts-mc-linux64( 4/ 8), 23.061: [Blue] ~1048 levels ~31457280 states ~91983664 transitions
pins2lts-mc-linux64( 7/ 8), 44.854: [Blue] ~677 levels ~62914560 states ~184254592 transitions
pins2lts-mc-linux64( 7/ 8), 91.792: [Blue] ~750 levels ~125829120 states ~372659056 transitions
pins2lts-mc-linux64( 0/ 8), 107.645: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 107.727:
pins2lts-mc-linux64( 0/ 8), 107.727: Explored 108142558 states 370825925 transitions, fanout: 3.429
pins2lts-mc-linux64( 0/ 8), 107.727: Total exploration time 107.690 sec (107.580 sec minimum, 107.626 sec on average)
pins2lts-mc-linux64( 0/ 8), 107.727: States per second: 1004202, Transitions per second: 3443457
pins2lts-mc-linux64( 0/ 8), 107.727:
pins2lts-mc-linux64( 0/ 8), 107.727: State space has 106601397 states, 65059924 are accepting
pins2lts-mc-linux64( 0/ 8), 107.727: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 107.727: blue states: 108142558 (101.45%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 107.727: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 107.727: all-red states: 67005650 (62.86%), bogus 2609671 (2.45%)
pins2lts-mc-linux64( 0/ 8), 107.727:
pins2lts-mc-linux64( 0/ 8), 107.727: Total memory used for local state coloring: 240.2MB
pins2lts-mc-linux64( 0/ 8), 107.727:
pins2lts-mc-linux64( 0/ 8), 107.727: Queue width: 8B, total height: 15740579, memory: 120.09MB
pins2lts-mc-linux64( 0/ 8), 107.727: Tree memory: 1069.3MB, 10.5 B/state, compr.: 25.0%
pins2lts-mc-linux64( 0/ 8), 107.727: Tree fill ratio (roots/leafs): 79.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 107.727: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 107.727: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 107.727: Est. total memory use: 1189.4MB (~1144.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14063589931532232971;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14063589931532232971;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 12:05:26] [INFO ] Flatten gal took : 2 ms
[2022-05-21 12:05:26] [INFO ] Time to serialize gal into /tmp/LTLFireability5002615975656199069.gal : 1 ms
[2022-05-21 12:05:26] [INFO ] Time to serialize properties into /tmp/LTLFireability1590516291054584372.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5002615975656199069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1590516291054584372.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 2 LTL properties
Checking formula 0 : !(((F("((Entered<1)||(Cabins<1))"))&&(G(F((G("(Out<1)"))||(X("((WaitBag>=1)&&(Bags>=1))")))))))
Formula 0 simplified : !(F"((Entered<1)||(Cabins<1))" & GF(G"(Out<1)" | X"((WaitBag>=1)&&(Bags>=1))"))
Detected timeout of ITS tools.
[2022-05-21 12:26:20] [INFO ] Flatten gal took : 3 ms
[2022-05-21 12:26:20] [INFO ] Input system was already deterministic with 7 transitions.
[2022-05-21 12:26:20] [INFO ] Transformed 9 places.
[2022-05-21 12:26:20] [INFO ] Transformed 7 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 12:26:20] [INFO ] Time to serialize gal into /tmp/LTLFireability6522174068171338884.gal : 0 ms
[2022-05-21 12:26:20] [INFO ] Time to serialize properties into /tmp/LTLFireability16661366905407604579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6522174068171338884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16661366905407604579.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((Entered<1)||(Cabins<1))"))&&(G(F((G("(Out<1)"))||(X("((WaitBag>=1)&&(Bags>=1))")))))))
Formula 0 simplified : !(F"((Entered<1)||(Cabins<1))" & GF(G"(Out<1)" | X"((WaitBag>=1)&&(Bags>=1))"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r258-tall-165303545700428"
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 '
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 ;