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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.7K Apr 29 12:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 12:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K 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-07-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653130410682

Running Version 202205111006
[2022-05-21 10:53:31] [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:53:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 10:53:31] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-21 10:53:31] [INFO ] Transformed 9 places.
[2022-05-21 10:53:31] [INFO ] Transformed 7 transitions.
[2022-05-21 10:53:31] [INFO ] Parsed PT model containing 9 places and 7 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SwimmingPool-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-07-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-07-LTLFireability-10 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 9 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:53:32] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 10:53:32] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:32] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:53:32] [INFO ] Dead Transitions using invariants and state equation in 31 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:53:32] [INFO ] Flatten gal took : 13 ms
[2022-05-21 10:53:32] [INFO ] Flatten gal took : 3 ms
[2022-05-21 10:53:32] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 2566 steps, including 0 resets, run visited all 13 properties in 24 ms. (steps per millisecond=106 )
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((F(G(p0)) U (X(X((G(X(p0))&&p1)))||p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 5 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:53:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:32] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:53:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-21 10:53:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:53:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s2 1), p0:(AND (GEQ s0 1) (GEQ s6 1)), p1:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 58 in 1 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-01 finished in 675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((F(p1)&&p0) U !(G(X(p3))&&p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:33] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:33] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:53:33] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:33] [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 291 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p3), (OR (NOT p3) (AND p1 (NOT p2))), (OR (NOT p3) p1)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1 p2 p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 6}], [{ cond=(OR p1 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(AND (GEQ s0 1) (GEQ s7 1)), p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(GEQ s5 1), p3:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 2 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-02 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(p0))||p1) U G((G(p2)||X(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:53:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:33] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:34] [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.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p2:(GEQ s5 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1141 reset in 111 ms.
Stack based approach found an accepted trace after 307 steps with 13 reset with depth 69 and stack size 69 in 1 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-03 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(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:53:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:34] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:53:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:34] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 10:53:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 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 7457 reset in 97 ms.
Product exploration explored 100000 steps with 7436 reset in 113 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 114 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 34 ms :[(NOT p0)]
Finished random walk after 355 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=177 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 10:53:35] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:53:35] [INFO ] Added : 3 causal constraints over 1 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 5 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:35] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-21 10:53:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
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 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 143 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=143 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-21 10:53:35] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:53:35] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15135 reset in 91 ms.
Product exploration explored 100000 steps with 15126 reset in 114 ms.
Built C files in :
/tmp/ltsmin1497569277073794059
[2022-05-21 10:53:35] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-21 10:53:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:53:35] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-21 10:53:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:53:35] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-21 10:53:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:53:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1497569277073794059
Running compilation step : cd /tmp/ltsmin1497569277073794059;'/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 160 ms.
Running link step : cd /tmp/ltsmin1497569277073794059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1497569277073794059;'/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/stateBased6061608704052610865.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-07-LTLFireability-04 finished in 1922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(p0))&&X(G(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:53:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:36] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:36] [INFO ] Implicit Places using invariants and state equation in 27 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:53:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s6 1), p0:(GEQ s2 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-05 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:36] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 10:53:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-21 10:53:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:36] [INFO ] Dead Transitions using invariants and state equation in 20 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 69 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5761 reset in 63 ms.
Stack based approach found an accepted trace after 1537 steps with 90 reset with depth 15 and stack size 15 in 1 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-06 finished in 236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&G(p2)&&p0)))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:36] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-21 10:53:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:36] [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 132 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1)), p2:(AND (GEQ s3 1) (GEQ s7 1)), p1:(OR (LT s0 1) (LT s7 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 190 reset in 72 ms.
Stack based approach found an accepted trace after 55 steps with 1 reset with depth 35 and stack size 35 in 0 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-07 finished in 295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 3 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:37] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-21 10:53:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-08 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:(AND (GEQ s1 1) (GEQ s4 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 13162 reset in 58 ms.
Product exploration explored 100000 steps with 12097 reset in 82 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 122 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 10:53:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:53:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-21 10:53:37] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:53:37] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:37] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-21 10:53:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 142 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 10:53:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:38] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 10:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 10:53:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:53:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 10:53:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:38] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 10:53:38] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:53:38] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12721 reset in 67 ms.
Product exploration explored 100000 steps with 10306 reset in 107 ms.
Built C files in :
/tmp/ltsmin2949807363613601932
[2022-05-21 10:53:38] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-21 10:53:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:53:38] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-21 10:53:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:53:38] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-21 10:53:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 10:53:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2949807363613601932
Running compilation step : cd /tmp/ltsmin2949807363613601932;'/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 74 ms.
Running link step : cd /tmp/ltsmin2949807363613601932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2949807363613601932;'/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/stateBased17407286323201709283.hoa' '--buchi-type=spotba'
LTSmin run took 6265 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-07-LTLFireability-08 finished in 8194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((X(p0)||p1))&&p0))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [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.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(LT s4 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 558 reset in 114 ms.
Stack based approach found an accepted trace after 38 steps with 2 reset with depth 33 and stack size 33 in 0 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-11 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(F(p1) U p2)||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:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [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 93 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(GEQ s5 1), p2:(GEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 619 reset in 114 ms.
Stack based approach found an accepted trace after 160 steps with 1 reset with depth 158 and stack size 158 in 1 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-12 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:45] [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 68 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-13 finished in 152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(!(G(p1) U p0)) U X(p0)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:46] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:46] [INFO ] Implicit Places using invariants and state equation in 18 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:53:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 188 ms :[p1, (OR (NOT p0) p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s5 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, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10253 reset in 55 ms.
Product exploration explored 100000 steps with 10252 reset in 77 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 (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), p1, (OR (NOT p0) p1)]
Finished random walk after 1493 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=248 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:47] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 10:53:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:47] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 10:53:47] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:53:47] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:47] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:47] [INFO ] Implicit Places using invariants and state equation in 25 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:53:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), p1, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 1067 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), p1, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), p1, (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 10:53:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:53:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 10:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:53:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 10:53:48] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 10:53:48] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), p1, (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 10192 reset in 61 ms.
Product exploration explored 100000 steps with 10258 reset in 68 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), p1, (NOT p0), (OR (NOT p0) p1)]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 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 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 10:53:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:49] [INFO ] Dead Transitions using invariants and state equation in 28 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 19007 reset in 118 ms.
Product exploration explored 100000 steps with 18969 reset in 120 ms.
Built C files in :
/tmp/ltsmin3892589276366320766
[2022-05-21 10:53:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3892589276366320766
Running compilation step : cd /tmp/ltsmin3892589276366320766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin3892589276366320766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3892589276366320766;'/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/stateBased11433128747096724656.hoa' '--buchi-type=spotba'
LTSmin run took 7117 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-07-LTLFireability-14 finished in 10514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F((F(p0)&&X(p1)))&&!p1) U G(p2)))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 10:53:56] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 10:53:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-21 10:53:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 10:53:56] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 10:53:56] [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 499 ms :[(NOT p2), p1, (AND p0 p1), (AND p1 p0), (AND (NOT p2) p1 p0), (AND p1 (NOT p2) p0), (AND (NOT p2) p1), true, (AND (NOT p1) p0), (NOT p2), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={} source=1 dest: 7}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 9}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 7}, { cond=(AND p2 p1), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=10 dest: 9}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s8 1)), p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1340 steps with 514 reset in 8 ms.
FORMULA SwimmingPool-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-07-LTLFireability-15 finished in 620 ms.
All properties solved by simple procedures.
Total runtime 25331 ms.

BK_STOP 1653130437260

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

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