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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 12:53 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 4.0K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:13 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-06-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653128475724

Running Version 202205111006
[2022-05-21 10:21:16] [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 10:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 10:21:17] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2022-05-21 10:21:17] [INFO ] Transformed 9 places.
[2022-05-21 10:21:17] [INFO ] Transformed 7 transitions.
[2022-05-21 10:21:17] [INFO ] Parsed PT model containing 9 places and 7 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SwimmingPool-PT-06-LTLFireability-08 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 10:21:17] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-21 10:21:17] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:17] [INFO ] Dead Transitions using invariants and state equation in 27 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 10:21:17] [INFO ] Flatten gal took : 13 ms
[2022-05-21 10:21:17] [INFO ] Flatten gal took : 4 ms
[2022-05-21 10:21:17] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 366 steps, including 0 resets, run visited all 12 properties in 23 ms. (steps per millisecond=15 )
FORMULA SwimmingPool-PT-06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SwimmingPool-PT-06-LTLFireability-11 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' '!((G(X(p0))||(p1 U F(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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:18] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:18] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 10:21:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:18] [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 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(GEQ s2 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][false, false, false]]
Product exploration explored 100000 steps with 24948 reset in 190 ms.
Product exploration explored 100000 steps with 24998 reset in 99 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 (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1)]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:19] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 10:21:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:21:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:21:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 10:21:19] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:21:19] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 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.
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
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 0 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 5 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 10:21:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-21 10:21:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:21:19] [INFO ] Dead Transitions using invariants and state equation in 21 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.
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 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-06-LTLFireability-00 finished in 1645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(((X(p0)&&p0) U !X(p0))))))'
Support contains 1 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 10:21:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:19] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:19] [INFO ] Implicit Places using invariants and state equation in 24 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 10:21:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:19] [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 155 ms :[p0, p0, true, p0, p0]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-01 finished in 246 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))||G((X(F(p1))&&p1)))))'
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 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 2 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 10:21:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:19] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:21:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:21:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-21 10:21:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:21:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:19] [INFO ] Dead Transitions using invariants and state equation in 17 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 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s4 1), p1:(GEQ s1 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 203 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-02 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1)||(G(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 10:21:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:20] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:20] [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 304 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s4 1), p0:(OR (GEQ s4 1) (AND (GEQ s3 1) (GEQ s7 1))), p2:(OR (GEQ s5 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-03 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((X(p1)||p2))||G(p2))))'
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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:20] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:21:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:20] [INFO ] Implicit Places using invariants and state equation in 27 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 10:21:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:20] [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 236 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s8 1)), p2:(AND (GEQ s3 1) (GEQ s7 1)), p1:(OR (AND (GEQ s1 1) (GEQ s8 1)) (AND (GEQ s3 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-05 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(X(p0) U (!F(p1)||(F(!p0) U p0))))))'
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 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 10:21:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:20] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-21 10:21:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:20] [INFO ] Dead Transitions using invariants and state equation in 21 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 104 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s3 1), p0:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8 reset in 71 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-06 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !X(X(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
[2022-05-21 10:21:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:21] [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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:21] [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 288 ms :[p1, p1, p1, p1, p1, p1, p1, true]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p1:(GEQ s4 1), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 160 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 p0)), (X (X (NOT p0))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 8 states, 11 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1, p1, true]
Finished random walk after 305 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=152 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, p1, true]
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 10:21:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:22] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:22] [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.
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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1, p1, true]
Finished random walk after 305 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=152 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 25000 reset in 47 ms.
Product exploration explored 100000 steps with 25000 reset in 48 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, p1, true]
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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 10:21:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Built C files in :
/tmp/ltsmin3672369219837489214
[2022-05-21 10:21:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3672369219837489214
Running compilation step : cd /tmp/ltsmin3672369219837489214;'/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 255 ms.
Running link step : cd /tmp/ltsmin3672369219837489214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3672369219837489214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14609983782249902794.hoa' '--buchi-type=spotba'
LTSmin run took 199 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-06-LTLFireability-07 finished in 3479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
Support contains 1 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 10:21:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:24] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:24] [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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:24] [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 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 42 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-06-LTLFireability-09 finished in 300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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
Applied a total of 4 rules in 2 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 10:21:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:24] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 10:21:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:25] [INFO ] Dead Transitions using invariants and state equation in 35 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 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-10 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:(GEQ s3 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 10088 reset in 86 ms.
Product exploration explored 100000 steps with 10154 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 184 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=92 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:21:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-21 10:21:25] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 10:21:25] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-21 10:21:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 184 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=184 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:21:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 10:21:26] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:21:26] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10012 reset in 67 ms.
Product exploration explored 100000 steps with 9981 reset in 60 ms.
Built C files in :
/tmp/ltsmin17185207837929427360
[2022-05-21 10:21:26] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 10:21:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:21:26] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 10:21:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:21:26] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 10:21:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:21:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17185207837929427360
Running compilation step : cd /tmp/ltsmin17185207837929427360;'/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/ltsmin17185207837929427360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17185207837929427360;'/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/stateBased778293765133775831.hoa' '--buchi-type=spotba'
LTSmin run took 2855 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-06-LTLFireability-10 finished in 4634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(F(G(p0)) U p0)&&!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
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 10:21:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:29] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-21 10:21:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 10:21:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:29] [INFO ] Dead Transitions using invariants and state equation in 20 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 105 ms :[p0, p0, p0]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 583 reset in 60 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-12 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 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 10:21:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:29] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:29] [INFO ] Implicit Places using invariants and state equation in 20 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 10:21:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:29] [INFO ] Dead Transitions using invariants and state equation in 17 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 p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-13 finished in 160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(G(X(p0))))||X(p1)))))'
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 10:21:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:30] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:30] [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 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LT s2 1), p0:(OR (GEQ s5 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 68 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 0 ms.
FORMULA SwimmingPool-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLFireability-14 finished in 346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||p1))&&F(X(X((X(!p0)&&p2))))))'
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 10:21:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:30] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:30] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s5 1), p2:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6304 reset in 74 ms.
Product exploration explored 100000 steps with 6514 reset in 63 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) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 323 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Finished random walk after 490 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=245 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 p2)), (F (AND p0 (NOT p2))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 406 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:32] [INFO ] Computed 3 place invariants in 1 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 p2)), (F (AND p0 (NOT p2))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:32] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:32] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:32] [INFO ] Dead Transitions using invariants and state equation in 20 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 p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Finished random walk after 521 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (AND (NOT p2) p0)), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:34] [INFO ] Computed 3 place invariants in 0 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (AND (NOT p2) p0)), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 7 factoid took 465 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Product exploration explored 100000 steps with 6233 reset in 58 ms.
Product exploration explored 100000 steps with 5948 reset in 78 ms.
Applying partial POR strategy [false, true, true, false, false, false]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
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 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 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 10:21:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 4333 reset in 94 ms.
Product exploration explored 100000 steps with 4302 reset in 148 ms.
Built C files in :
/tmp/ltsmin689703670408689293
[2022-05-21 10:21:35] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin689703670408689293
Running compilation step : cd /tmp/ltsmin689703670408689293;'/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 64 ms.
Running link step : cd /tmp/ltsmin689703670408689293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin689703670408689293;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10137256343586597768.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 3 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 10:21:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:50] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:21:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:21:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:21:51] [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.
Built C files in :
/tmp/ltsmin9054540004979952819
[2022-05-21 10:21:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9054540004979952819
Running compilation step : cd /tmp/ltsmin9054540004979952819;'/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 67 ms.
Running link step : cd /tmp/ltsmin9054540004979952819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9054540004979952819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8746252317700093629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 10:22:06] [INFO ] Flatten gal took : 2 ms
[2022-05-21 10:22:06] [INFO ] Flatten gal took : 2 ms
[2022-05-21 10:22:06] [INFO ] Time to serialize gal into /tmp/LTL13763273360441040688.gal : 1 ms
[2022-05-21 10:22:06] [INFO ] Time to serialize properties into /tmp/LTL15086246085093280850.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/LTL13763273360441040688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15086246085093280850.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/LTL1376327...268
Read 1 LTL properties
Checking formula 0 : !(((G((F("(Dressed>=1)"))||("(Undress>=1)")))&&(F(X(X(((X("(Dressed<1)"))&&("(InBath>=1)"))&&("(Cabins>=1)")))))))
Formula 0 simplified : !(G("(Undress>=1)" | F"(Dressed>=1)") & FXX("(Cabins>=1)" & "(InBath>=1)" & X"(Dressed<1)"))
Detected timeout of ITS tools.
[2022-05-21 10:22:21] [INFO ] Flatten gal took : 2 ms
[2022-05-21 10:22:21] [INFO ] Applying decomposition
[2022-05-21 10:22:21] [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/graph8295803676111404224.txt' '-o' '/tmp/graph8295803676111404224.bin' '-w' '/tmp/graph8295803676111404224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8295803676111404224.bin' '-l' '-1' '-v' '-w' '/tmp/graph8295803676111404224.weights' '-q' '0' '-e' '0.001'
[2022-05-21 10:22:21] [INFO ] Decomposing Gal with order
[2022-05-21 10:22:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 10:22:21] [INFO ] Flatten gal took : 25 ms
[2022-05-21 10:22:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 10:22:21] [INFO ] Time to serialize gal into /tmp/LTL3382465433653979485.gal : 1 ms
[2022-05-21 10:22:21] [INFO ] Time to serialize properties into /tmp/LTL6546165725679913741.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/LTL3382465433653979485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6546165725679913741.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/LTL3382465...245
Read 1 LTL properties
Checking formula 0 : !(((G((F("(u0.Dressed>=1)"))||("(u1.Undress>=1)")))&&(F(X(X(((X("(u0.Dressed<1)"))&&("(u2.InBath>=1)"))&&("(u1.Cabins>=1)")))))))
Formula 0 simplified : !(G("(u1.Undress>=1)" | F"(u0.Dressed>=1)") & FXX("(u1.Cabins>=1)" & "(u2.InBath>=1)" & X"(u0.Dressed<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11764126514672096949
[2022-05-21 10:22:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11764126514672096949
Running compilation step : cd /tmp/ltsmin11764126514672096949;'/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/ltsmin11764126514672096949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11764126514672096949;'/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(X((X(!(LTLAPp0==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-06-LTLFireability-15 finished in 81021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||p1))&&F(X(X((X(!p0)&&p2))))))'
Found a CL insensitive property : SwimmingPool-PT-06-LTLFireability-15
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p2) (NOT p1) p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 1 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
[2022-05-21 10:22:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:22:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:22:51] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:22:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Running random walk in product with property : SwimmingPool-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s4 1), p2:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3358 reset in 57 ms.
Product exploration explored 100000 steps with 3203 reset in 268 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) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Finished random walk after 400 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:53] [INFO ] Computed 3 place invariants in 0 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in 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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:22:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:22:54] [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 6 rows 8 cols
[2022-05-21 10:22:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:22:54] [INFO ] Dead Transitions using invariants and state equation in 21 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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Finished random walk after 766 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:55] [INFO ] Computed 3 place invariants in 1 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 6 factoid took 495 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Product exploration explored 100000 steps with 3596 reset in 67 ms.
Product exploration explored 100000 steps with 5498 reset in 88 ms.
Applying partial POR strategy [false, true, true, false, false, false]
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
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.
[2022-05-21 10:22:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:22:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:22:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 4697 reset in 68 ms.
Product exploration explored 100000 steps with 3791 reset in 113 ms.
Built C files in :
/tmp/ltsmin9220836806471706655
[2022-05-21 10:22:57] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9220836806471706655
Running compilation step : cd /tmp/ltsmin9220836806471706655;'/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/ltsmin9220836806471706655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9220836806471706655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7643295717037796755.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 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 10:23:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:23:12] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:23:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:23:12] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:23:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:23:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin418563564524422071
[2022-05-21 10:23:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin418563564524422071
Running compilation step : cd /tmp/ltsmin418563564524422071;'/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 62 ms.
Running link step : cd /tmp/ltsmin418563564524422071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin418563564524422071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8234486780746617660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 10:23:27] [INFO ] Flatten gal took : 9 ms
[2022-05-21 10:23:27] [INFO ] Flatten gal took : 2 ms
[2022-05-21 10:23:27] [INFO ] Time to serialize gal into /tmp/LTL7359652170029752592.gal : 1 ms
[2022-05-21 10:23:27] [INFO ] Time to serialize properties into /tmp/LTL12246228619994820359.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/LTL7359652170029752592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12246228619994820359.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/LTL7359652...267
Read 1 LTL properties
Checking formula 0 : !(((G((F("(Dressed>=1)"))||("(Undress>=1)")))&&(F(X(X(((X("(Dressed<1)"))&&("(InBath>=1)"))&&("(Cabins>=1)")))))))
Formula 0 simplified : !(G("(Undress>=1)" | F"(Dressed>=1)") & FXX("(Cabins>=1)" & "(InBath>=1)" & X"(Dressed<1)"))
Detected timeout of ITS tools.
[2022-05-21 10:23:42] [INFO ] Flatten gal took : 1 ms
[2022-05-21 10:23:42] [INFO ] Applying decomposition
[2022-05-21 10:23:42] [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/graph17136585057055983255.txt' '-o' '/tmp/graph17136585057055983255.bin' '-w' '/tmp/graph17136585057055983255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17136585057055983255.bin' '-l' '-1' '-v' '-w' '/tmp/graph17136585057055983255.weights' '-q' '0' '-e' '0.001'
[2022-05-21 10:23:42] [INFO ] Decomposing Gal with order
[2022-05-21 10:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 10:23:42] [INFO ] Flatten gal took : 1 ms
[2022-05-21 10:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 10:23:42] [INFO ] Time to serialize gal into /tmp/LTL6653038922177732846.gal : 1 ms
[2022-05-21 10:23:42] [INFO ] Time to serialize properties into /tmp/LTL2620046716491210809.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/LTL6653038922177732846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2620046716491210809.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/LTL6653038...245
Read 1 LTL properties
Checking formula 0 : !(((G((F("(u2.Dressed>=1)"))||("(u1.Undress>=1)")))&&(F(X(X(((X("(u2.Dressed<1)"))&&("(u1.InBath>=1)"))&&("(u2.Cabins>=1)")))))))
Formula 0 simplified : !(G("(u1.Undress>=1)" | F"(u2.Dressed>=1)") & FXX("(u1.InBath>=1)" & "(u2.Cabins>=1)" & X"(u2.Dressed<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5867215393166279228
[2022-05-21 10:23:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5867215393166279228
Running compilation step : cd /tmp/ltsmin5867215393166279228;'/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/ltsmin5867215393166279228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5867215393166279228;'/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(X((X(!(LTLAPp0==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-06-LTLFireability-15 finished in 81322 ms.
[2022-05-21 10:24:12] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9238675112173359649
[2022-05-21 10:24:12] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 10:24:12] [INFO ] Applying decomposition
[2022-05-21 10:24:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:24:12] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 10:24:12] [INFO ] Flatten gal took : 1 ms
[2022-05-21 10:24:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:24:12] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 10:24:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:24:12] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9238675112173359649
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/graph12782505091356969535.txt' '-o' '/tmp/graph12782505091356969535.bin' '-w' '/tmp/graph12782505091356969535.weights'
Running compilation step : cd /tmp/ltsmin9238675112173359649;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12782505091356969535.bin' '-l' '-1' '-v' '-w' '/tmp/graph12782505091356969535.weights' '-q' '0' '-e' '0.001'
[2022-05-21 10:24:12] [INFO ] Decomposing Gal with order
[2022-05-21 10:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 10:24:12] [INFO ] Flatten gal took : 1 ms
[2022-05-21 10:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 10:24:12] [INFO ] Time to serialize gal into /tmp/LTLFireability2152043427811399547.gal : 0 ms
[2022-05-21 10:24:12] [INFO ] Time to serialize properties into /tmp/LTLFireability18023048500890030773.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/LTLFireability2152043427811399547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18023048500890030773.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...268
Read 1 LTL properties
Checking formula 0 : !(((G((F("(u0.Dressed>=1)"))||("(u1.Undress>=1)")))&&(F(X(X(((X("(u0.Dressed<1)"))&&("(u2.InBath>=1)"))&&("(u1.Cabins>=1)")))))))
Formula 0 simplified : !(G("(u1.Undress>=1)" | F"(u0.Dressed>=1)") & FXX("(u1.Cabins>=1)" & "(u2.InBath>=1)" & X"(u0.Dressed<1)"))
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin9238675112173359649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9238675112173359649;'/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(X((X(!(LTLAPp0==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: ([]((<>((LTLAPp0==true))||(LTLAPp1==true)))&&<>(X(X((X(!(LTLAPp0==true))&&(LTLAPp2==true))))))
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: "([]((<>((LTLAPp0==true))||(LTLAPp1==true)))&&<>(X(X((X(!(LTLAPp0==true))&&(LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.061: DFS-FIFO for weak LTL, using special progress label 11
pins2lts-mc-linux64( 0/ 8), 0.062: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.062: State length is 10, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.062: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.062: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.062: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.062: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.085: ~104 levels ~960 states ~4096 transitions
pins2lts-mc-linux64( 4/ 8), 0.115: ~203 levels ~1920 states ~8552 transitions
pins2lts-mc-linux64( 4/ 8), 0.165: ~407 levels ~3840 states ~16728 transitions
pins2lts-mc-linux64( 4/ 8), 0.195: ~447 levels ~7680 states ~22640 transitions
pins2lts-mc-linux64( 4/ 8), 0.224: ~447 levels ~15360 states ~36024 transitions
pins2lts-mc-linux64( 3/ 8), 0.315: ~435 levels ~30720 states ~58088 transitions
pins2lts-mc-linux64( 3/ 8), 0.441: ~435 levels ~61440 states ~116256 transitions
pins2lts-mc-linux64( 4/ 8), 0.647: ~452 levels ~122880 states ~287848 transitions
pins2lts-mc-linux64( 4/ 8), 1.035: ~452 levels ~245760 states ~601928 transitions
pins2lts-mc-linux64( 3/ 8), 1.550: ~435 levels ~491520 states ~1153912 transitions
pins2lts-mc-linux64( 4/ 8), 2.146: ~452 levels ~983040 states ~2568256 transitions
pins2lts-mc-linux64( 4/ 8), 2.830: ~452 levels ~1966080 states ~5227256 transitions
pins2lts-mc-linux64( 4/ 8), 4.140: ~452 levels ~3932160 states ~10717920 transitions
pins2lts-mc-linux64( 5/ 8), 6.782: ~452 levels ~7864320 states ~21367424 transitions
pins2lts-mc-linux64( 5/ 8), 12.608: ~452 levels ~15728640 states ~44053120 transitions
pins2lts-mc-linux64( 4/ 8), 25.215: ~452 levels ~31457280 states ~92211032 transitions
pins2lts-mc-linux64( 4/ 8), 51.106: ~452 levels ~62914560 states ~190201920 transitions
pins2lts-mc-linux64( 4/ 8), 109.182: ~452 levels ~125829120 states ~402449664 transitions
pins2lts-mc-linux64( 5/ 8), 173.454: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 173.488:
pins2lts-mc-linux64( 0/ 8), 173.488: mean standard work distribution: 0.7% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 173.488:
pins2lts-mc-linux64( 0/ 8), 173.488: Explored 161985064 states 530913053 transitions, fanout: 3.278
pins2lts-mc-linux64( 0/ 8), 173.488: Total exploration time 173.410 sec (173.360 sec minimum, 173.383 sec on average)
pins2lts-mc-linux64( 0/ 8), 173.488: States per second: 934116, Transitions per second: 3061606
pins2lts-mc-linux64( 0/ 8), 173.488:
pins2lts-mc-linux64( 0/ 8), 173.488: Progress states detected: 2
pins2lts-mc-linux64( 0/ 8), 173.488: Redundant explorations: 20.6887
pins2lts-mc-linux64( 0/ 8), 173.488:
pins2lts-mc-linux64( 0/ 8), 173.488: Queue width: 8B, total height: 3596, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 173.488: Tree memory: 1104.2MB, 8.6 B/state, compr.: 20.5%
pins2lts-mc-linux64( 0/ 8), 173.488: Tree fill ratio (roots/leafs): 99.0%/31.0%
pins2lts-mc-linux64( 0/ 8), 173.488: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 173.488: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 173.488: Est. total memory use: 1104.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9238675112173359649;'/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(X((X(!(LTLAPp0==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9238675112173359649;'/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(X((X(!(LTLAPp0==true))&&(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 10:45:10] [INFO ] Flatten gal took : 2 ms
[2022-05-21 10:45:10] [INFO ] Time to serialize gal into /tmp/LTLFireability5396363852000904428.gal : 0 ms
[2022-05-21 10:45:10] [INFO ] Time to serialize properties into /tmp/LTLFireability7912798979738324022.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/LTLFireability5396363852000904428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7912798979738324022.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 1 LTL properties
Checking formula 0 : !(((G((F("(Dressed>=1)"))||("(Undress>=1)")))&&(F(X(X(((X("(Dressed<1)"))&&("(InBath>=1)"))&&("(Cabins>=1)")))))))
Formula 0 simplified : !(G("(Undress>=1)" | F"(Dressed>=1)") & FXX("(Cabins>=1)" & "(InBath>=1)" & X"(Dressed<1)"))
Detected timeout of ITS tools.
[2022-05-21 11:06:08] [INFO ] Flatten gal took : 4 ms
[2022-05-21 11:06:09] [INFO ] Input system was already deterministic with 7 transitions.
[2022-05-21 11:06:09] [INFO ] Transformed 9 places.
[2022-05-21 11:06:09] [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 11:06:09] [INFO ] Time to serialize gal into /tmp/LTLFireability10881110069462914082.gal : 1 ms
[2022-05-21 11:06:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8831490836149181105.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/LTLFireability10881110069462914082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8831490836149181105.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((F("(Dressed>=1)"))||("(Undress>=1)")))&&(F(X(X(((X("(Dressed<1)"))&&("(InBath>=1)"))&&("(Cabins>=1)")))))))
Formula 0 simplified : !(G("(Undress>=1)" | F"(Dressed>=1)") & FXX("(Cabins>=1)" & "(InBath>=1)" & X"(Dressed<1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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-06"
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-06, 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-165303545700404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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