Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.9K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717163407025

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 13:50:08] [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]
[2024-05-31 13:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 13:50:08] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2024-05-31 13:50:08] [INFO ] Transformed 9 places.
[2024-05-31 13:50:08] [INFO ] Transformed 7 transitions.
[2024-05-31 13:50:08] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA SwimmingPool-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-LTLCardinality-11 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 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-31 13:50:08] [INFO ] Computed 3 invariants in 12 ms
[2024-05-31 13:50:09] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-31 13:50:09] [INFO ] Invariant cache hit.
[2024-05-31 13:50:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-31 13:50:09] [INFO ] Invariant cache hit.
[2024-05-31 13:50:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2024-05-31 13:50:09] [INFO ] Flatten gal took : 12 ms
[2024-05-31 13:50:09] [INFO ] Flatten gal took : 2 ms
[2024-05-31 13:50:09] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 1646 steps, including 0 resets, run visited all 22 properties in 15 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 13 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-31 13:50:09] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 13:50:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 13:50:09] [INFO ] Invariant cache hit.
[2024-05-31 13:50:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-31 13:50:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:50:09] [INFO ] Invariant cache hit.
[2024-05-31 13:50:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 6/9 places, 4/7 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 186 ms.
Stack based approach found an accepted trace after 2272 steps with 0 reset with depth 2273 and stack size 1650 in 4 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-00 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-31 13:50:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:50:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-31 13:50:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Dead Transitions using invariants and state equation in 36 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 110 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Stack based approach found an accepted trace after 4155 steps with 0 reset with depth 4156 and stack size 3798 in 5 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-01 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||X(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.
// Phase 1: matrix 7 rows 9 cols
[2024-05-31 13:50:10] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 13:50:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ s2 s5), p1:(LEQ s4 s6), p2:(OR (GT 1 s4) (GT s6 s3))], 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 9 steps with 0 reset in 2 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-02 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((p1&&X(p0))||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 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-31 13:50:10] [INFO ] Invariant cache hit.
[2024-05-31 13:50:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s5 s2), p0:(GT s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-05 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(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.
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Dead Transitions using invariants and state equation in 27 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 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p1:(LEQ s8 s1), p0:(LEQ s0 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
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
[2024-05-31 13:50:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:50:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-31 13:50:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 77 ms.
Stack based approach found an accepted trace after 1122 steps with 0 reset with depth 1123 and stack size 825 in 2 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-10 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||F(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
[2024-05-31 13:50:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:50:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-31 13:50:11] [INFO ] Invariant cache hit.
[2024-05-31 13:50:11] [INFO ] Dead Transitions using invariants and state equation in 22 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 159 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(GT s4 s8), p1:(GT s7 s8), p0:(GT 2 s5)], 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 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 90 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 p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-06-LTLCardinality-12 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0 U (p1||G(p0)))))||(X(p2) U ((p2&&X(p2))||X(G(p2))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-31 13:50:12] [INFO ] Invariant cache hit.
[2024-05-31 13:50:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 13:50:12] [INFO ] Invariant cache hit.
[2024-05-31 13:50:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-31 13:50:12] [INFO ] Invariant cache hit.
[2024-05-31 13:50:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s1), p1:(AND (GT s7 s3) (GT 2 s6)), p0:(GT s7 s3)], 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 6 reset in 123 ms.
Stack based approach found an accepted trace after 2474 steps with 0 reset with depth 2475 and stack size 2448 in 4 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-13 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&(!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-31 13:50:12] [INFO ] Invariant cache hit.
[2024-05-31 13:50:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 13:50:12] [INFO ] Invariant cache hit.
[2024-05-31 13:50:12] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-31 13:50:12] [INFO ] Invariant cache hit.
[2024-05-31 13:50:12] [INFO ] Dead Transitions using invariants and state equation in 25 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 251 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GT 3 s7) (NOT (OR (LEQ 1 s1) (LEQ 2 s3)))), p1:(OR (LEQ 1 s1) (LEQ 2 s3)), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-14 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2))||G(p3))))'
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 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-31 13:50:13] [INFO ] Invariant cache hit.
[2024-05-31 13:50:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 13:50:13] [INFO ] Invariant cache hit.
[2024-05-31 13:50:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-31 13:50:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:50:13] [INFO ] Invariant cache hit.
[2024-05-31 13:50:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : SwimmingPool-PT-06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p3 p2) (AND p0 p3 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)), acceptance={2} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={1, 2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s3), p3:(LEQ s3 s6), p2:(LEQ 3 s1), p1:(LEQ 1 s5)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 602 reset in 191 ms.
Product exploration explored 100000 steps with 548 reset in 190 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 p3 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p3 p2) (AND p0 p3 p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)))), (X (NOT (AND p0 p3 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (AND p0 p3 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p3 p2) (AND p0 p3 p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1))))), (X (X (NOT (AND p0 p3 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (AND p0 p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 196 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10039 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=143 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 13:50:14] [INFO ] Invariant cache hit.
[2024-05-31 13:50:14] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 13:50:14] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p3 p2) (AND p0 p3 p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1)))), (X (NOT (AND p0 p3 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (AND p0 p3 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p3 p2) (AND p0 p3 p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p0) (NOT p3) p1))))), (X (X (NOT (AND p0 p3 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (AND p0 p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (G (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))), (F (OR (AND p0 p1 p3) (AND p0 p2 p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) p3))), (F (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p2 p3))), (F (AND (NOT p0) p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 28 factoid took 524 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
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 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-31 13:50:14] [INFO ] Invariant cache hit.
[2024-05-31 13:50:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 13:50:14] [INFO ] Invariant cache hit.
[2024-05-31 13:50:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-31 13:50:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:50:15] [INFO ] Invariant cache hit.
[2024-05-31 13:50:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. 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) p3 (NOT p2)), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 p3) (AND p2 p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 p3) (AND p2 p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Finished random walk after 1374 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=458 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2)), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 p3) (AND p2 p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 p3) (AND p2 p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p3)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (OR (AND p1 p3) (AND p2 p3))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 13 factoid took 515 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 614 reset in 138 ms.
Stack based approach found an accepted trace after 42320 steps with 228 reset with depth 3949 and stack size 3920 in 53 ms.
FORMULA SwimmingPool-PT-06-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-06-LTLCardinality-15 finished in 3270 ms.
All properties solved by simple procedures.
Total runtime 7778 ms.

BK_STOP 1717163417438

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SwimmingPool-PT-06, 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 r417-tall-171690556500482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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