fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303545700396
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SwimmingPool-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10233.460 3129244.00 4031759.00 6685.10 TFTTTFFFFFFTTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.8K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 3.6K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 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-05-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653126848606

Running Version 202205111006
[2022-05-21 09:54:09] [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:54:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 09:54:09] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2022-05-21 09:54:09] [INFO ] Transformed 9 places.
[2022-05-21 09:54:09] [INFO ] Transformed 7 transitions.
[2022-05-21 09:54:09] [INFO ] Parsed PT model containing 9 places and 7 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SwimmingPool-PT-05-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:10] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 09:54:10] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-21 09:54:10] [INFO ] Flatten gal took : 23 ms
[2022-05-21 09:54:10] [INFO ] Flatten gal took : 3 ms
[2022-05-21 09:54:10] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 306 steps, including 0 resets, run visited all 10 properties in 10 ms. (steps per millisecond=30 )
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' '!(X((F(p0)||p1)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 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:54:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:10] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:10] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:54:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-00 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)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s5 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 5714 reset in 180 ms.
Product exploration explored 100000 steps with 5692 reset in 103 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)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 2 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 384 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 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 44 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:11] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:54:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-21 09:54:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:54:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-21 09:54:11] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 09:54:11] [INFO ] Added : 4 causal constraints over 1 iterations in 9 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 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 26 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:54:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:11] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 09:54:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:11] [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.
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 89 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 21 ms :[(NOT p0)]
Finished random walk after 205 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 206 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:54:12] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 09:54:12] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:54:12] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7476 reset in 100 ms.
Product exploration explored 100000 steps with 7409 reset in 65 ms.
Built C files in :
/tmp/ltsmin6447207902368963239
[2022-05-21 09:54:12] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 09:54:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:12] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 09:54:12] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:12] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 09:54:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:12] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6447207902368963239
Running compilation step : cd /tmp/ltsmin6447207902368963239;'/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 140 ms.
Running link step : cd /tmp/ltsmin6447207902368963239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6447207902368963239;'/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/stateBased13667184311664225500.hoa' '--buchi-type=spotba'
LTSmin run took 458 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-05-LTLFireability-00 finished in 2588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(X(p1)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 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:54:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:13] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:13] [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 213 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-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 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:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-01 finished in 294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(X(p0)) U !X(X(p1)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:13] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:13] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 09:54:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 3}]], initial=6, aps=[p1:(GEQ s6 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Product exploration explored 100000 steps with 25000 reset in 103 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 p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 8 states, 11 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:14] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:14] [INFO ] Computed 3 place invariants in 16 ms
[2022-05-21 09:54:14] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 62 ms.
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 09:54:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:16] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Built C files in :
/tmp/ltsmin4374580730273086592
[2022-05-21 09:54:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4374580730273086592
Running compilation step : cd /tmp/ltsmin4374580730273086592;'/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 61 ms.
Running link step : cd /tmp/ltsmin4374580730273086592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin4374580730273086592;'/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/stateBased3455104929071592809.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-05-LTLFireability-03 finished in 2990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:16] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:16] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:16] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-21 09:54:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22 reset in 68 ms.
Product exploration explored 100000 steps with 24 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 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 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 214 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:17] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-21 09:54:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17 reset in 71 ms.
Product exploration explored 100000 steps with 23 reset in 69 ms.
Built C files in :
/tmp/ltsmin14222806290336303538
[2022-05-21 09:54:18] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 09:54:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:18] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 09:54:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:18] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 09:54:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14222806290336303538
Running compilation step : cd /tmp/ltsmin14222806290336303538;'/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 59 ms.
Running link step : cd /tmp/ltsmin14222806290336303538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin14222806290336303538;'/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/stateBased17846136436127799964.hoa' '--buchi-type=spotba'
LTSmin run took 3051 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-05-LTLFireability-04 finished in 4800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(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
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:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [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.
[2022-05-21 09:54:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-05 finished in 254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p0))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 09:54:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-06 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 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:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-21 09:54:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:21] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-07 finished in 181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 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:54:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:22] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-21 09:54:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:22] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-09 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U G(X(G(p0)))))&&(p0 U F(p1)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:22] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:22] [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 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-10 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 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:54:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:22] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-21 09:54:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:22] [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 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1245 reset in 68 ms.
Product exploration explored 100000 steps with 1088 reset in 79 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)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 253 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 09:54:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:54:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:54:23] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:54:23] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 8 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 : 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:54:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:23] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-21 09:54:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:54:23] [INFO ] Dead Transitions using invariants and state equation in 20 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 : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 107 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 56 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:54:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:24] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:54:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:54:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:54:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:54:24] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:54:24] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1150 reset in 70 ms.
Product exploration explored 100000 steps with 788 reset in 77 ms.
Built C files in :
/tmp/ltsmin8454733537665272161
[2022-05-21 09:54:24] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 09:54:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:24] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 09:54:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:24] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 09:54:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:24] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8454733537665272161
Running compilation step : cd /tmp/ltsmin8454733537665272161;'/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 77 ms.
Running link step : cd /tmp/ltsmin8454733537665272161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin8454733537665272161;'/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/stateBased15911068401199076571.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
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 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:39] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:54:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 09:54:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:54:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:54:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Built C files in :
/tmp/ltsmin13181502270042418541
[2022-05-21 09:54:39] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 09:54:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:39] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 09:54:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:39] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 09:54:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:54:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13181502270042418541
Running compilation step : cd /tmp/ltsmin13181502270042418541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin13181502270042418541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13181502270042418541;'/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/stateBased3204652639896426239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 09:54:54] [INFO ] Flatten gal took : 7 ms
[2022-05-21 09:54:54] [INFO ] Flatten gal took : 3 ms
[2022-05-21 09:54:54] [INFO ] Time to serialize gal into /tmp/LTL5524145286209849081.gal : 1 ms
[2022-05-21 09:54:54] [INFO ] Time to serialize properties into /tmp/LTL2367618903520333486.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5524145286209849081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2367618903520333486.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5524145...266
Read 1 LTL properties
Checking formula 0 : !(((G("(Dress>=1)"))||(G(F("((Entered>=1)&&(Cabins>=1))")))))
Formula 0 simplified : !(G"(Dress>=1)" | GF"((Entered>=1)&&(Cabins>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 09:55:09] [INFO ] Flatten gal took : 3 ms
[2022-05-21 09:55:09] [INFO ] Applying decomposition
[2022-05-21 09:55:09] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16382929262479339410.txt' '-o' '/tmp/graph16382929262479339410.bin' '-w' '/tmp/graph16382929262479339410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16382929262479339410.bin' '-l' '-1' '-v' '-w' '/tmp/graph16382929262479339410.weights' '-q' '0' '-e' '0.001'
[2022-05-21 09:55:09] [INFO ] Decomposing Gal with order
[2022-05-21 09:55:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:55:09] [INFO ] Flatten gal took : 25 ms
[2022-05-21 09:55:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 09:55:09] [INFO ] Time to serialize gal into /tmp/LTL6942536961255576165.gal : 1 ms
[2022-05-21 09:55:09] [INFO ] Time to serialize properties into /tmp/LTL17859531648025763623.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6942536961255576165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17859531648025763623.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6942536...246
Read 1 LTL properties
Checking formula 0 : !(((G("(u0.Dress>=1)"))||(G(F("((u1.Entered>=1)&&(u2.Cabins>=1))")))))
Formula 0 simplified : !(G"(u0.Dress>=1)" | GF"((u1.Entered>=1)&&(u2.Cabins>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16455910799683117569
[2022-05-21 09:55:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16455910799683117569
Running compilation step : cd /tmp/ltsmin16455910799683117569;'/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 94 ms.
Running link step : cd /tmp/ltsmin16455910799683117569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16455910799683117569;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-05-LTLFireability-11 finished in 77537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:40] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:55:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:55:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5665 reset in 58 ms.
Product exploration explored 100000 steps with 5617 reset in 61 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 30 ms :[(NOT p0)]
Finished random walk after 359 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=179 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:40] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:55:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:55:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:55:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:55:40] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:55:40] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:55:40] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:40] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:40] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-21 09:55:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:55:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:40] [INFO ] Dead Transitions using invariants and state equation in 15 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 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=206 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:55:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:55:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:55:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:55:41] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:55:41] [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 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10276 reset in 51 ms.
Product exploration explored 100000 steps with 10306 reset in 51 ms.
Built C files in :
/tmp/ltsmin16631207727517831700
[2022-05-21 09:55:41] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 09:55:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:55:41] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 09:55:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:55:41] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 09:55:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:55:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16631207727517831700
Running compilation step : cd /tmp/ltsmin16631207727517831700;'/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 72 ms.
Running link step : cd /tmp/ltsmin16631207727517831700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16631207727517831700;'/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/stateBased10055240713432121012.hoa' '--buchi-type=spotba'
LTSmin run took 311 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-05-LTLFireability-12 finished in 1645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((!(!p0 U F(p1))||p2)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:41] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:55:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s2 1), p2:(AND (LT s2 1) (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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-13 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G((p1 U (p2 U p1)))&&p0)) U !p2)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 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:55:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:41] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 179 ms :[p2, p2, true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s5 1), p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND p2 p0) (AND p0 p1)))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) (NOT p1))
Knowledge based reduction with 9 factoid took 406 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-05-LTLFireability-14 finished in 762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(p0)&&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:55:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:55:42] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:55:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:55:42] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s0 1) (LT s7 1)), p0:(AND (GEQ s5 1) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 289 reset in 81 ms.
Stack based approach found an accepted trace after 75 steps with 1 reset with depth 48 and stack size 48 in 0 ms.
FORMULA SwimmingPool-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-05-LTLFireability-15 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
[2022-05-21 09:55:43] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15182685553789218491
[2022-05-21 09:55:43] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 09:55:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:55:43] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 09:55:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:55:43] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 09:55:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:55:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15182685553789218491
Running compilation step : cd /tmp/ltsmin15182685553789218491;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 09:55:43] [INFO ] Applying decomposition
[2022-05-21 09:55:43] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10164610161898309855.txt' '-o' '/tmp/graph10164610161898309855.bin' '-w' '/tmp/graph10164610161898309855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10164610161898309855.bin' '-l' '-1' '-v' '-w' '/tmp/graph10164610161898309855.weights' '-q' '0' '-e' '0.001'
[2022-05-21 09:55:43] [INFO ] Decomposing Gal with order
[2022-05-21 09:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:55:43] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 09:55:43] [INFO ] Time to serialize gal into /tmp/LTLFireability5876774335117309106.gal : 0 ms
[2022-05-21 09:55:43] [INFO ] Time to serialize properties into /tmp/LTLFireability3535109534110851850.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5876774335117309106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3535109534110851850.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !(((G("(u2.Dress>=1)"))||(G(F("((u0.Entered>=1)&&(u2.Cabins>=1))")))))
Formula 0 simplified : !(G"(u2.Dress>=1)" | GF"((u0.Entered>=1)&&(u2.Cabins>=1))")
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin15182685553789218491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15182685553789218491;'/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' '--ltl' '([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: LTL layer: formula: ([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: "([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 9, guards 7
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.011: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.019: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.019: State length is 10, there are 13 groups
pins2lts-mc-linux64( 0/ 8), 0.019: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.019: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.019: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.019: Visible groups: 0 / 13, labels: 2 / 11
pins2lts-mc-linux64( 0/ 8), 0.019: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.019: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.035: [Blue] ~120 levels ~960 states ~1936 transitions
pins2lts-mc-linux64( 3/ 8), 0.054: [Blue] ~128 levels ~1920 states ~4048 transitions
pins2lts-mc-linux64( 3/ 8), 0.058: [Blue] ~128 levels ~3840 states ~7584 transitions
pins2lts-mc-linux64( 3/ 8), 0.083: [Blue] ~128 levels ~7680 states ~16496 transitions
pins2lts-mc-linux64( 3/ 8), 0.130: [Blue] ~128 levels ~15360 states ~36424 transitions
pins2lts-mc-linux64( 2/ 8), 0.221: [Blue] ~121 levels ~30720 states ~71248 transitions
pins2lts-mc-linux64( 3/ 8), 0.335: [Blue] ~140 levels ~61440 states ~156288 transitions
pins2lts-mc-linux64( 2/ 8), 0.624: [Blue] ~151 levels ~122880 states ~304208 transitions
pins2lts-mc-linux64( 3/ 8), 1.087: [Blue] ~314 levels ~245760 states ~638648 transitions
pins2lts-mc-linux64( 2/ 8), 1.710: [Blue] ~676 levels ~491520 states ~891152 transitions
pins2lts-mc-linux64( 2/ 8), 2.444: [Blue] ~688 levels ~983040 states ~1951480 transitions
pins2lts-mc-linux64( 1/ 8), 3.419: [Blue] ~1394 levels ~1966080 states ~4990640 transitions
pins2lts-mc-linux64( 1/ 8), 5.206: [Blue] ~44631 levels ~3932160 states ~8756440 transitions
pins2lts-mc-linux64( 6/ 8), 8.787: [Blue] ~719 levels ~7864320 states ~18766928 transitions
pins2lts-mc-linux64( 6/ 8), 17.698: [Blue] ~378370 levels ~15728640 states ~36664952 transitions
pins2lts-mc-linux64( 5/ 8), 43.210: [Blue] ~2233915 levels ~31457280 states ~79928952 transitions
pins2lts-mc-linux64( 5/ 8), 96.656: [Blue] ~5799584 levels ~62914560 states ~141710584 transitions
pins2lts-mc-linux64( 5/ 8), 211.834: [Blue] ~12884399 levels ~125829120 states ~241984016 transitions
pins2lts-mc-linux64( 7/ 8), 240.102, file cndfs.c, line 706: assertion "seen != FSET_FULL" failed
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15182685553789218491;'/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' '--ltl' '([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15182685553789218491;'/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' '--ltl' '([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 10:16:14] [INFO ] Flatten gal took : 1 ms
[2022-05-21 10:16:14] [INFO ] Time to serialize gal into /tmp/LTLFireability3006093957448816799.gal : 3 ms
[2022-05-21 10:16:14] [INFO ] Time to serialize properties into /tmp/LTLFireability2275822262266368552.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3006093957448816799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2275822262266368552.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !(((G("(Dress>=1)"))||(G(F("((Entered>=1)&&(Cabins>=1))")))))
Formula 0 simplified : !(G"(Dress>=1)" | GF"((Entered>=1)&&(Cabins>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 10:36:45] [INFO ] Flatten gal took : 5 ms
[2022-05-21 10:36:45] [INFO ] Input system was already deterministic with 7 transitions.
[2022-05-21 10:36:45] [INFO ] Transformed 9 places.
[2022-05-21 10:36:45] [INFO ] Transformed 7 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 10:36:45] [INFO ] Time to serialize gal into /tmp/LTLFireability12461251140521181532.gal : 0 ms
[2022-05-21 10:36:45] [INFO ] Time to serialize properties into /tmp/LTLFireability3176572295729302959.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12461251140521181532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3176572295729302959.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(Dress>=1)"))||(G(F("((Entered>=1)&&(Cabins>=1))")))))
Formula 0 simplified : !(G"(Dress>=1)" | GF"((Entered>=1)&&(Cabins>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
56543 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,565.452,2691864,1,0,281,1.58912e+07,17,1,616,1.44617e+07,683
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-05-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 3128043 ms.

BK_STOP 1653129977850

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

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