Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.9K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653123625698

Running Version 202205111006
[2022-05-21 09:00:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 09:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 09:00:26] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2022-05-21 09:00:26] [INFO ] Transformed 9 places.
[2022-05-21 09:00:26] [INFO ] Transformed 7 transitions.
[2022-05-21 09:00:26] [INFO ] Parsed PT model containing 9 places and 7 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:27] [INFO ] Computed 3 place invariants in 12 ms
[2022-05-21 09:00:27] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:27] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 09:00:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-21 09:00:27] [INFO ] Flatten gal took : 13 ms
[2022-05-21 09:00:27] [INFO ] Flatten gal took : 3 ms
[2022-05-21 09:00:27] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 306 steps, including 0 resets, run visited all 17 properties in 16 ms. (steps per millisecond=19 )
FORMULA SwimmingPool-PT-02-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(((G(p1)||p2)&&p0))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 6 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:27] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:27] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-21 09:00:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p2:(GEQ s5 1), p0:(AND (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9977 reset in 213 ms.
Product exploration explored 100000 steps with 10066 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 84 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 413 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:29] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 09:00:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-21 09:00:29] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:00:29] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:00:29] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:29] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-21 09:00:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 415 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 84 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0))))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:31] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:00:31] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 10000 reset in 93 ms.
Product exploration explored 100000 steps with 10092 reset in 199 ms.
Built C files in :
/tmp/ltsmin12212202144393491388
[2022-05-21 09:00:31] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 09:00:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:31] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 09:00:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:31] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 09:00:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12212202144393491388
Running compilation step : cd /tmp/ltsmin12212202144393491388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 187 ms.
Running link step : cd /tmp/ltsmin12212202144393491388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12212202144393491388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1324624819824823177.hoa' '--buchi-type=spotba'
LTSmin run took 231 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-02-LTLFireability-00 finished in 4247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||X((F(p0)||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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:32] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:00:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s1 1) (GEQ s8 1) (GEQ s5 1)), p2:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5660 reset in 73 ms.
Product exploration explored 100000 steps with 5713 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-21 09:00:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:00:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:00:32] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:00:32] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in 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 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:32] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-21 09:00:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:00:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:00:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:00:33] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:00:33] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10193 reset in 52 ms.
Product exploration explored 100000 steps with 10230 reset in 56 ms.
Built C files in :
/tmp/ltsmin7401808827964646154
[2022-05-21 09:00:33] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 09:00:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:33] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 09:00:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:33] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 09:00:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7401808827964646154
Running compilation step : cd /tmp/ltsmin7401808827964646154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin7401808827964646154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7401808827964646154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11755799483394407690.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-02-LTLFireability-01 finished in 1647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U !(F(p2)&&p1)))||G(p3)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:33] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:33] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:00:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2), (AND p1 p2 (NOT p3)), true, p2, (NOT p3), (AND p2 (NOT p3))]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND p3 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p3 p1 p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p3 p2), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(GEQ s2 1), p1:(AND (GEQ s5 1) (GEQ s6 1)), p2:(GEQ s6 1), p0:(OR (GEQ s6 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 54 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 p3) (NOT p1) p2 p0), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p3 p1 p2 (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p3 p1 p0))), (X (NOT (AND p3 p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p3 p1 p0)))), (X (X (NOT (AND p3 p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), true, (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p3 p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) (NOT p1) p2 p0)
Knowledge based reduction with 28 factoid took 658 ms. Reduced automaton from 7 states, 21 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-02-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-02-LTLFireability-02 finished in 1116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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
[2022-05-21 09:00:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:34] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-LTLFireability-04 finished in 163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U ((p1 U F(p2))||X(X(p3))))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:35] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 520 ms :[(OR p3 p2), p2, p3, (OR (AND p0 p2) (AND p0 p3)), (AND p2 p3), p3, p3, (AND p0 p3), (AND p0 p2), (AND p0 p3), (AND p2 p0 p3), (AND p0 p3)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={1} source=0 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0, 1} source=1 dest: 0}, { cond=(NOT p2), acceptance={1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={1} source=2 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 5}, { cond=p2, acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 9}], [{ cond=(AND p3 p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={1} source=4 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={1} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 p2), acceptance={0, 1} source=5 dest: 6}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p3 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=6 dest: 3}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND p3 p0 p2), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={1} source=7 dest: 8}, { cond=(AND p3 p0 (NOT p2)), acceptance={0, 1} source=7 dest: 9}], [{ cond=(AND p0 p2), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=8 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 7}, { cond=(AND p0 p2), acceptance={0, 1} source=9 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={1} source=9 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=9 dest: 11}], [{ cond=(AND p3 p0 p2), acceptance={0, 1} source=10 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={1} source=10 dest: 8}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={0} source=11 dest: 7}, { cond=(AND p3 p0 p2), acceptance={0, 1} source=11 dest: 7}, { cond=(AND p3 p0 (NOT p2)), acceptance={1} source=11 dest: 10}, { cond=(AND p3 p0 (NOT p2)), acceptance={0, 1} source=11 dest: 11}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s8 1)), p0:(OR (GEQ s6 1) (AND (GEQ s3 1) (GEQ s7 1))), p3:(GEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1255 reset in 179 ms.
Stack based approach found an accepted trace after 133 steps with 6 reset with depth 97 and stack size 97 in 1 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-02-LTLFireability-05 finished in 812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:35] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-06 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 617 steps with 0 reset in 2 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-LTLFireability-06 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(X(p1))||F(p1))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:36] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:36] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 09:00:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-21 09:00:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GEQ s1 1), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7462 reset in 86 ms.
Product exploration explored 100000 steps with 7509 reset in 85 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 368 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Finished random walk after 118 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F p0), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 8 factoid took 491 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:37] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:37] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 09:00:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:00:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:37] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:00:37] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:00:37] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:00:37] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:37] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-21 09:00:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Finished random walk after 85 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F p0), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 8 factoid took 446 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:00:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-21 09:00:39] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 09:00:39] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:39] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:00:39] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7446 reset in 63 ms.
Product exploration explored 100000 steps with 7458 reset in 64 ms.
Built C files in :
/tmp/ltsmin6936215808600715820
[2022-05-21 09:00:39] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 09:00:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:39] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 09:00:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:39] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 09:00:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6936215808600715820
Running compilation step : cd /tmp/ltsmin6936215808600715820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin6936215808600715820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6936215808600715820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10682953064838143480.hoa' '--buchi-type=spotba'
LTSmin run took 235 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-02-LTLFireability-07 finished in 3708 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((F(p1)&&p0))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:39] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 09:00:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8275 reset in 107 ms.
Stack based approach found an accepted trace after 252 steps with 20 reset with depth 32 and stack size 32 in 2 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-02-LTLFireability-08 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:40] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-21 09:00:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-02-LTLFireability-09 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0) U p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:40] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s6 1), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4062 steps with 4 reset in 5 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-LTLFireability-10 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X(G(p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:40] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:40] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:40] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s6 1) (AND (GEQ s0 1) (GEQ s7 1))), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 44 ms.
Product exploration explored 100000 steps with 50000 reset in 44 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) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-02-LTLFireability-11 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(p0) U p0)||!(F(p1) U 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
[2022-05-21 09:00:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:41] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND p0 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p0 p2)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s6 1) (GEQ s5 1)), p2:(AND (GEQ s0 1) (GEQ s7 1)), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p2) (NOT p0))
Knowledge based reduction with 18 factoid took 713 ms. Reduced automaton from 4 states, 21 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-02-LTLFireability-12 finished in 1129 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 4 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:42] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-21 09:00:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2702 reset in 82 ms.
Product exploration explored 100000 steps with 2940 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:43] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:00:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:43] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:43] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 09:00:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 09:00:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-21 09:00:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:43] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:00:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2942 reset in 57 ms.
Product exploration explored 100000 steps with 3040 reset in 64 ms.
Built C files in :
/tmp/ltsmin7900280525726169695
[2022-05-21 09:00:43] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-21 09:00:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:43] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-21 09:00:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:43] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-21 09:00:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:00:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7900280525726169695
Running compilation step : cd /tmp/ltsmin7900280525726169695;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin7900280525726169695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7900280525726169695;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased143167607914919422.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-02-LTLFireability-13 finished in 1900 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(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
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:44] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 09:00:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:00:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p1:(OR (LT s1 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 692 steps with 0 reset with depth 693 and stack size 679 in 1 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-02-LTLFireability-14 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(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.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:44] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24980 reset in 38 ms.
Product exploration explored 100000 steps with 25010 reset in 59 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-21 09:00:45] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:00:45] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT 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
[2022-05-21 09:00:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:45] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:45] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:00:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:00:45] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:00:45] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25045 reset in 42 ms.
Product exploration explored 100000 steps with 25047 reset in 48 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT 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: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 09:00:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:00:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:00:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 28584 reset in 108 ms.
Product exploration explored 100000 steps with 28600 reset in 103 ms.
Built C files in :
/tmp/ltsmin151474342874523861
[2022-05-21 09:00:46] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin151474342874523861
Running compilation step : cd /tmp/ltsmin151474342874523861;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 63 ms.
Running link step : cd /tmp/ltsmin151474342874523861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin151474342874523861;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased577670438286443676.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA SwimmingPool-PT-02-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-02-LTLFireability-15 finished in 2481 ms.
All properties solved by simple procedures.
Total runtime 20132 ms.

BK_STOP 1653123647141

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SwimmingPool-PT-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545600372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-02.tgz
mv SwimmingPool-PT-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;