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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.4K Apr 29 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:52 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.4K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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-03-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653124842701

Running Version 202205111006
[2022-05-21 09:20:43] [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:20:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 09:20:44] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-21 09:20:44] [INFO ] Transformed 9 places.
[2022-05-21 09:20:44] [INFO ] Transformed 7 transitions.
[2022-05-21 09:20:44] [INFO ] Parsed PT model containing 9 places and 7 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SwimmingPool-PT-03-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-15 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 16 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:20:44] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 09:20:44] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:20:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-21 09:20:44] [INFO ] Flatten gal took : 14 ms
[2022-05-21 09:20:44] [INFO ] Flatten gal took : 4 ms
[2022-05-21 09:20:44] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 186 steps, including 0 resets, run visited all 11 properties in 15 ms. (steps per millisecond=12 )
FORMULA SwimmingPool-PT-03-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(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:20:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:45] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LT s6 1), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-01 finished in 440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(G(p0))||p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:20:45] [INFO ] Implicit Places using invariants and state equation in 28 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:20:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 1 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-02 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U F(!p1)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 10 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:20:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:45] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:45] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 09:20:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-21 09:20:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 40 ms :[p1]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (LT s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7439 reset in 195 ms.
Product exploration explored 100000 steps with 7465 reset in 109 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 196 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 50 ms :[p1]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[p1]
Stuttering acceptance computed with spot in 36 ms :[p1]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:20:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:20:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:20:46] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:20:46] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:46] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-21 09:20:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:46] [INFO ] Dead Transitions using invariants and state equation in 24 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 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 :[p1]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[p1]
Stuttering acceptance computed with spot in 29 ms :[p1]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 09:20:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:20:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:47] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:20:47] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:20:47] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 38 ms :[p1]
Product exploration explored 100000 steps with 7443 reset in 105 ms.
Product exploration explored 100000 steps with 7455 reset in 77 ms.
Built C files in :
/tmp/ltsmin17431358136404857623
[2022-05-21 09:20:47] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 09:20:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:20:47] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 09:20:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:20:47] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 09:20:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:20:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17431358136404857623
Running compilation step : cd /tmp/ltsmin17431358136404857623;'/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 168 ms.
Running link step : cd /tmp/ltsmin17431358136404857623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17431358136404857623;'/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/stateBased13978326696381827194.hoa' '--buchi-type=spotba'
LTSmin run took 740 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-LTLFireability-03 finished in 2789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G(!G((F(G(p0))&&p0)))) U 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 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 6 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:20:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:48] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:20:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-21 09:20:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:20:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:48] [INFO ] Dead Transitions using invariants and state equation in 26 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-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10312 reset in 94 ms.
Product exploration explored 100000 steps with 10241 reset in 58 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 92 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 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:20:49] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 09:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-21 09:20:49] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:20:49] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (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 0 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:20:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:49] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:20:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:49] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-21 09:20:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:20:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:49] [INFO ] Dead Transitions using invariants and state equation in 21 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 29 ms :[(NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:20:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:20:49] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:20:49] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10236 reset in 53 ms.
Product exploration explored 100000 steps with 10234 reset in 55 ms.
Built C files in :
/tmp/ltsmin2815024206059346862
[2022-05-21 09:20:49] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 09:20:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:20:49] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 09:20:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:20:49] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 09:20:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:20:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2815024206059346862
Running compilation step : cd /tmp/ltsmin2815024206059346862;'/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/ltsmin2815024206059346862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2815024206059346862;'/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/stateBased14834281670749847560.hoa' '--buchi-type=spotba'
LTSmin run took 121 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-LTLFireability-05 finished in 1556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0 U p1) U p0)||F(p2)||p0) U !X(X(p3))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:50] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:20:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:50] [INFO ] Implicit Places using invariants and state equation in 25 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:20:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:50] [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 522 ms :[p3, (AND (NOT p2) p3), p3, (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), p3, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={} source=8 dest: 10}], [{ cond=(NOT p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(GEQ s4 1), p0:(GEQ s5 1), p1:(GEQ s2 1), p3:(GEQ s6 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7360 reset in 155 ms.
Stack based approach found an accepted trace after 6053 steps with 457 reset with depth 9 and stack size 9 in 11 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-06 finished in 797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(F(p1))||G(p2)||G(p1)))&&p0)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:50] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-21 09:20:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p2:(AND (GEQ s0 1) (GEQ s6 1)), p1:(GEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 7470 reset in 77 ms.
Product exploration explored 100000 steps with 7390 reset in 182 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 p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (AND p2 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), true]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 869 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:52] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:52] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (AND p2 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), true, (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p0), (F (AND p0 p2)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 12 factoid took 993 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:20:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:20:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:54] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:20:54] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:20:54] [INFO ] Added : 4 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:54] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:54] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:20:54] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:20:54] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:54] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:54] [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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:54] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 505 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:54] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F p0), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 7 factoid took 655 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:56] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 09:20:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:20:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:20:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:20:56] [INFO ] Added : 4 causal constraints over 1 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:20:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 09:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:20:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-21 09:20:56] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 09:20:56] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 7901 reset in 84 ms.
Product exploration explored 100000 steps with 7928 reset in 79 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-21 09:20:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:20:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:20:56] [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.
Product exploration explored 100000 steps with 8032 reset in 113 ms.
Product exploration explored 100000 steps with 7971 reset in 118 ms.
Built C files in :
/tmp/ltsmin9764804789142296785
[2022-05-21 09:20:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9764804789142296785
Running compilation step : cd /tmp/ltsmin9764804789142296785;'/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 69 ms.
Running link step : cd /tmp/ltsmin9764804789142296785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9764804789142296785;'/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/stateBased1264599121326763715.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 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:21:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:21:12] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:21:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:21:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:21:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:21:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin5502741511535189664
[2022-05-21 09:21:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5502741511535189664
Running compilation step : cd /tmp/ltsmin5502741511535189664;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin5502741511535189664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5502741511535189664;'/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/stateBased15085174179558830987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 09:21:27] [INFO ] Flatten gal took : 3 ms
[2022-05-21 09:21:27] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:21:27] [INFO ] Time to serialize gal into /tmp/LTL9664319921592136376.gal : 1 ms
[2022-05-21 09:21:27] [INFO ] Time to serialize properties into /tmp/LTL2241981014338341785.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/LTL9664319921592136376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2241981014338341785.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/LTL9664319...266
Read 1 LTL properties
Checking formula 0 : !((F(((G(((X(F("(Dressed>=1)")))||(G("((Entered>=1)&&(Cabins>=1))")))||(G("(Dressed>=1)"))))&&("(Entered>=1)"))&&("(Cabins>=1)"))))
Formula 0 simplified : !F("(Cabins>=1)" & "(Entered>=1)" & G(XF"(Dressed>=1)" | G"((Entered>=1)&&(Cabins>=1))" | G"(Dressed>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 09:21:42] [INFO ] Flatten gal took : 5 ms
[2022-05-21 09:21:42] [INFO ] Applying decomposition
[2022-05-21 09:21:42] [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/graph4088997302464776668.txt' '-o' '/tmp/graph4088997302464776668.bin' '-w' '/tmp/graph4088997302464776668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4088997302464776668.bin' '-l' '-1' '-v' '-w' '/tmp/graph4088997302464776668.weights' '-q' '0' '-e' '0.001'
[2022-05-21 09:21:42] [INFO ] Decomposing Gal with order
[2022-05-21 09:21:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:21:42] [INFO ] Flatten gal took : 25 ms
[2022-05-21 09:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 09:21:42] [INFO ] Time to serialize gal into /tmp/LTL9199760893266926829.gal : 1 ms
[2022-05-21 09:21:42] [INFO ] Time to serialize properties into /tmp/LTL57100651801032726.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/LTL9199760893266926829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL57100651801032726.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/LTL9199760...243
Read 1 LTL properties
Checking formula 0 : !((F(((G(((X(F("(u0.Dressed>=1)")))||(G("((u0.Entered>=1)&&(u1.Cabins>=1))")))||(G("(u0.Dressed>=1)"))))&&("(u0.Entered>=1)"))&&("(u1....170
Formula 0 simplified : !F("(u0.Entered>=1)" & "(u1.Cabins>=1)" & G(XF"(u0.Dressed>=1)" | G"((u0.Entered>=1)&&(u1.Cabins>=1))" | G"(u0.Dressed>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12945530286154066222
[2022-05-21 09:21:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12945530286154066222
Running compilation step : cd /tmp/ltsmin12945530286154066222;'/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 79 ms.
Running link step : cd /tmp/ltsmin12945530286154066222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin12945530286154066222;'/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' '<>(([]((X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))||[]((LTLAPp1==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-03-LTLFireability-07 finished in 82014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))&&X(F(p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:22:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:12] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:22:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:12] [INFO ] Implicit Places using invariants and state equation in 26 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:22:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:12] [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 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s3 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 7 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-08 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:13] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22: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 129 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s6 1), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24688 reset in 101 ms.
Stack based approach found an accepted trace after 77639 steps with 19073 reset with depth 11 and stack size 11 in 103 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-09 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(X(G(F(p0))))) U X(!(F(p0)||p1))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 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:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:13] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:13] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-21 09:22:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 46 ms :[(OR p0 p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(AND (GEQ s2 1) (GEQ s6 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 206 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-10 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U G(F((F(p0)&&p1))))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 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 4 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:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:13] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-21 09:22:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:13] [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 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-11 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2035 reset in 67 ms.
Product exploration explored 100000 steps with 2141 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:22:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 09:22:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:22:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:22:14] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 09:22:14] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:22:15] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 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 1 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:22:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:15] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:15] [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.
[2022-05-21 09:22:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:15] [INFO ] Dead Transitions using invariants and state equation in 21 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 : [(AND p0 (NOT p1)), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 09:22:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 09:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 09:22:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 09:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 09:22:16] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-21 09:22:16] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 09:22:16] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2144 reset in 85 ms.
Product exploration explored 100000 steps with 1842 reset in 100 ms.
Built C files in :
/tmp/ltsmin2221997286015886018
[2022-05-21 09:22:16] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 09:22:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:22:16] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 09:22:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:22:16] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 09:22:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:22:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2221997286015886018
Running compilation step : cd /tmp/ltsmin2221997286015886018;'/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 65 ms.
Running link step : cd /tmp/ltsmin2221997286015886018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2221997286015886018;'/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/stateBased913867839703561299.hoa' '--buchi-type=spotba'
LTSmin run took 6173 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-LTLFireability-11 finished in 8801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:22] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-21 09:22:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 09:22:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:22] [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 92 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s1 1) (OR (LT s2 1) (LT s5 1))), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 70 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-13 finished in 277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(p0))&&G(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:22:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 09:22:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 09:22:22] [INFO ] Implicit Places using invariants and state equation in 21 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:22:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 09:22:22] [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 120 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s4 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-14 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(F(p1))||G(p2)||G(p1)))&&p0)))'
[2022-05-21 09:22:23] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10521795826648524935
[2022-05-21 09:22:23] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 09:22:23] [INFO ] Applying decomposition
[2022-05-21 09:22:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:22:23] [INFO ] Flatten gal took : 1 ms
[2022-05-21 09:22:23] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 09:22:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:22:23] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 09:22:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 09:22:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10521795826648524935
Running compilation step : cd /tmp/ltsmin10521795826648524935;'/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'
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/graph1399396488267652332.txt' '-o' '/tmp/graph1399396488267652332.bin' '-w' '/tmp/graph1399396488267652332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1399396488267652332.bin' '-l' '-1' '-v' '-w' '/tmp/graph1399396488267652332.weights' '-q' '0' '-e' '0.001'
[2022-05-21 09:22:23] [INFO ] Decomposing Gal with order
[2022-05-21 09:22:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:22:23] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:22:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 09:22:23] [INFO ] Time to serialize gal into /tmp/LTLFireability635672708262195978.gal : 1 ms
[2022-05-21 09:22:23] [INFO ] Time to serialize properties into /tmp/LTLFireability12020884330443504914.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/LTLFireability635672708262195978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12020884330443504914.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 : !((F(((G(((X(F("(u0.Dressed>=1)")))||(G("((u0.Entered>=1)&&(u1.Cabins>=1))")))||(G("(u0.Dressed>=1)"))))&&("(u0.Entered>=1)"))&&("(u1....170
Formula 0 simplified : !F("(u0.Entered>=1)" & "(u1.Cabins>=1)" & G(XF"(u0.Dressed>=1)" | G"((u0.Entered>=1)&&(u1.Cabins>=1))" | G"(u0.Dressed>=1)"))
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin10521795826648524935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin10521795826648524935;'/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' '<>(([]((X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))||[]((LTLAPp1==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: <>(([]((X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))||[]((LTLAPp1==true))))&&(LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: "<>(([]((X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))||[]((LTLAPp1==true))))&&(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.021: State length is 10, there are 17 groups
pins2lts-mc-linux64( 0/ 8), 0.021: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.021: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.021: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.021: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.075: [Blue] ~120 levels ~960 states ~2688 transitions
pins2lts-mc-linux64( 6/ 8), 0.104: [Blue] ~240 levels ~1920 states ~6432 transitions
pins2lts-mc-linux64( 6/ 8), 0.125: [Blue] ~360 levels ~3840 states ~9904 transitions
pins2lts-mc-linux64( 0/ 8), 0.181: [Blue] ~234 levels ~7680 states ~19800 transitions
pins2lts-mc-linux64( 0/ 8), 0.275: [Blue] ~234 levels ~15360 states ~41784 transitions
pins2lts-mc-linux64( 7/ 8), 0.505: [Blue] ~283 levels ~30720 states ~78112 transitions
pins2lts-mc-linux64( 7/ 8), 0.884: [Blue] ~283 levels ~61440 states ~155016 transitions
pins2lts-mc-linux64( 7/ 8), 1.455: [Blue] ~283 levels ~122880 states ~313368 transitions
pins2lts-mc-linux64( 7/ 8), 2.702: [Blue] ~283 levels ~245760 states ~629800 transitions
pins2lts-mc-linux64( 7/ 8), 4.404: [Blue] ~283 levels ~491520 states ~1300720 transitions
pins2lts-mc-linux64( 2/ 8), 6.656: [Blue] ~2069 levels ~983040 states ~3448112 transitions
pins2lts-mc-linux64( 6/ 8), 10.072: [Blue] ~540 levels ~1966080 states ~6165096 transitions
pins2lts-mc-linux64( 6/ 8), 13.028: [Blue] ~714 levels ~3932160 states ~12354192 transitions
pins2lts-mc-linux64( 6/ 8), 16.928: [Blue] ~751 levels ~7864320 states ~24907288 transitions
pins2lts-mc-linux64( 6/ 8), 23.813: [Blue] ~155508 levels ~15728640 states ~54121736 transitions
pins2lts-mc-linux64( 1/ 8), 47.182: [Blue] ~1356622 levels ~31457280 states ~133433792 transitions
pins2lts-mc-linux64( 1/ 8), 102.516: [Blue] ~4771032 levels ~62914560 states ~329295240 transitions
pins2lts-mc-linux64( 5/ 8), 218.185: [Blue] ~13362015 levels ~125829120 states ~768602952 transitions
pins2lts-mc-linux64( 5/ 8), 273.622, file cndfs.c, line 199: assertion "onstack != FSET_FULL" failed
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10521795826648524935;'/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' '<>(([]((X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))||[]((LTLAPp1==true))))&&(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10521795826648524935;'/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' '<>(([]((X(<>((LTLAPp1==true)))||[]((LTLAPp2==true))||[]((LTLAPp1==true))))&&(LTLAPp0==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 09:42:56] [INFO ] Flatten gal took : 2 ms
[2022-05-21 09:42:56] [INFO ] Time to serialize gal into /tmp/LTLFireability12520987459724057126.gal : 1 ms
[2022-05-21 09:42:56] [INFO ] Time to serialize properties into /tmp/LTLFireability15997771300099269566.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/LTLFireability12520987459724057126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15997771300099269566.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...290
Read 1 LTL properties
Checking formula 0 : !((F(((G(((X(F("(Dressed>=1)")))||(G("((Entered>=1)&&(Cabins>=1))")))||(G("(Dressed>=1)"))))&&("(Entered>=1)"))&&("(Cabins>=1)"))))
Formula 0 simplified : !F("(Cabins>=1)" & "(Entered>=1)" & G(XF"(Dressed>=1)" | G"((Entered>=1)&&(Cabins>=1))" | G"(Dressed>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 10:03:29] [INFO ] Flatten gal took : 1 ms
[2022-05-21 10:03:29] [INFO ] Input system was already deterministic with 7 transitions.
[2022-05-21 10:03:29] [INFO ] Transformed 9 places.
[2022-05-21 10:03:29] [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:03:29] [INFO ] Time to serialize gal into /tmp/LTLFireability6736942521567978202.gal : 2 ms
[2022-05-21 10:03:29] [INFO ] Time to serialize properties into /tmp/LTLFireability13602133829941316418.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/LTLFireability6736942521567978202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13602133829941316418.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 : !((F(((G(((X(F("(Dressed>=1)")))||(G("((Entered>=1)&&(Cabins>=1))")))||(G("(Dressed>=1)"))))&&("(Entered>=1)"))&&("(Cabins>=1)"))))
Formula 0 simplified : !F("(Cabins>=1)" & "(Entered>=1)" & G(XF"(Dressed>=1)" | G"((Entered>=1)&&(Cabins>=1))" | G"(Dressed>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

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