Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699200339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SwimmingPool-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699200339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679209500821

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 07:05:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 07:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:05:02] [INFO ] Load time of PNML (sax parser for PT used): 16 ms
[2023-03-19 07:05:02] [INFO ] Transformed 9 places.
[2023-03-19 07:05:02] [INFO ] Transformed 7 transitions.
[2023-03-19 07:05:02] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SwimmingPool-PT-03-LTLCardinality-05 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
[2023-03-19 07:05:02] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 07:05:02] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 07:05:02] [INFO ] Invariant cache hit.
[2023-03-19 07:05:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-19 07:05:02] [INFO ] Invariant cache hit.
[2023-03-19 07:05:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 07:05:03] [INFO ] Flatten gal took : 13 ms
[2023-03-19 07:05:03] [INFO ] Flatten gal took : 2 ms
[2023-03-19 07:05:03] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 466 steps, including 0 resets, run visited all 30 properties in 24 ms. (steps per millisecond=19 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1&&F(p2))))))'
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 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 07:05:03] [INFO ] Invariant cache hit.
[2023-03-19 07:05:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 07:05:03] [INFO ] Invariant cache hit.
[2023-03-19 07:05:03] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 07:05:03] [INFO ] Invariant cache hit.
[2023-03-19 07:05:03] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(LEQ s8 s3), p1:(LEQ s7 s1), p0:(LEQ 3 s2)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 49 reset in 209 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 1 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-00 finished in 612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 8 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 07:05:04] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 07:05:04] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 07:05:04] [INFO ] Invariant cache hit.
[2023-03-19 07:05:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 07:05:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 07:05:04] [INFO ] Invariant cache hit.
[2023-03-19 07:05:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s5 s4), p0:(OR (LEQ s5 s4) (LEQ s2 s4))], 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 0 reset in 123 ms.
Stack based approach found an accepted trace after 809 steps with 0 reset with depth 810 and stack size 390 in 9 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-01 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U G(p2))||F(p3)))))'
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
[2023-03-19 07:05:04] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 07:05:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 07:05:04] [INFO ] Invariant cache hit.
[2023-03-19 07:05:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 07:05:04] [INFO ] Invariant cache hit.
[2023-03-19 07:05:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s2 s3), p2:(LEQ s1 s2), p1:(OR (LEQ 1 s4) (LEQ s1 s2)), p3:(LEQ s4 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 127 ms.
Stack based approach found an accepted trace after 4452 steps with 0 reset with depth 4453 and stack size 4405 in 7 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-02 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&F((G(F(p1))||(F(p1)&&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.
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s5 s0), p0:(GT s8 s5), p2:(GT 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 486 reset in 86 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-03 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((G(p0)||G(p1))) U G(!p0)) U 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 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
[2023-03-19 07:05:05] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-19 07:05:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 s2), p0:(GT 3 s5), p1:(GT 3 s3)], nbAcceptance=2, 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 0 reset in 85 ms.
Stack based approach found an accepted trace after 593 steps with 0 reset with depth 594 and stack size 268 in 8 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-04 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(p1))&&G(p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 07:05:05] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(LEQ 1 s5), p0:(GT s7 s4), p1:(GT 1 s4)], 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 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-06 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1&&(p1 U (!p0||G(!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.
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
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
[2023-03-19 07:05:06] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 07:05:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [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 SI_LTL mode , in 1 iterations and 88 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 115 ms :[p1, true, (OR (NOT p1) p0), (AND p1 p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 2 s3), p0:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3358 reset in 83 ms.
Stack based approach found an accepted trace after 39 steps with 1 reset with depth 15 and stack size 15 in 1 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-07 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 07:05:06] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s1 s8)], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6110 steps with 0 reset in 11 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-08 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 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 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-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:(AND (GT 1 s8) (GT 3 s6))], 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 13 reset in 71 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-09 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 07:05:06] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s8 s4), p0:(LEQ s6 s5)], 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, 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-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-10 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
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.
[2023-03-19 07:05:07] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 07:05:07] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 07:05:07] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s0 s1) (LEQ s3 s6)), p1:(AND (LEQ s0 s1) (LEQ 3 s5))], 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 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-03-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-03-LTLCardinality-11 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((p0 U p1)) U p2))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 07:05:07] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 07:05:07] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 07:05:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 07:05:07] [INFO ] Invariant cache hit.
[2023-03-19 07:05:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ 3 s7) (LEQ 2 s6) (LEQ s1 s8)), p1:(LEQ 3 s7), p0:(LEQ s1 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 9588 steps with 0 reset with depth 9589 and stack size 9462 in 18 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-12 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&(p0||G(p1))) U X(G(!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.
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 225 ms :[p0, false, (AND (NOT p1) p0), p0, true, (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(GT s8 s7), p1:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33408 reset in 106 ms.
Stack based approach found an accepted trace after 7957 steps with 2668 reset with depth 7 and stack size 7 in 7 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-13 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(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.
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s0)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-14 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 07:05:08] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 07:05:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-19 07:05:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 07:05:08] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-15 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:(LEQ s4 s2)], 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 87 reset in 71 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-15 finished in 226 ms.
All properties solved by simple procedures.
Total runtime 6684 ms.

BK_STOP 1679209509777

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-03"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is SwimmingPool-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699200339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;