Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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-08-00
FORMULA_NAME SwimmingPool-PT-08-01
FORMULA_NAME SwimmingPool-PT-08-02
FORMULA_NAME SwimmingPool-PT-08-03
FORMULA_NAME SwimmingPool-PT-08-04
FORMULA_NAME SwimmingPool-PT-08-05
FORMULA_NAME SwimmingPool-PT-08-06
FORMULA_NAME SwimmingPool-PT-08-07
FORMULA_NAME SwimmingPool-PT-08-08
FORMULA_NAME SwimmingPool-PT-08-09
FORMULA_NAME SwimmingPool-PT-08-10
FORMULA_NAME SwimmingPool-PT-08-11
FORMULA_NAME SwimmingPool-PT-08-12
FORMULA_NAME SwimmingPool-PT-08-13
FORMULA_NAME SwimmingPool-PT-08-14
FORMULA_NAME SwimmingPool-PT-08-15

=== Now, execution of the tool begins

BK_START 1621276876100

Running Version 0
[2021-05-17 18:41:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2021-05-17 18:41:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:41:17] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 18:41:17] [INFO ] Transformed 9 places.
[2021-05-17 18:41:17] [INFO ] Transformed 7 transitions.
[2021-05-17 18:41:17] [INFO ] Parsed PT model containing 9 places and 7 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:41:17] [INFO ] Initial state test concluded for 3 properties.
FORMULA SwimmingPool-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:17] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 18:41:17] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:17] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 18:41:18] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 18:41:18] [INFO ] Flatten gal took : 16 ms
FORMULA SwimmingPool-PT-08-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-08-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:41:18] [INFO ] Flatten gal took : 3 ms
[2021-05-17 18:41:18] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 856 steps, including 0 resets, run visited all 22 properties in 4 ms. (steps per millisecond=214 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X((X(p1) U ((p2&&X(p1))||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 18:41:18] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 18:41:18] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 13 ms
[2021-05-17 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-08-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s5 s2), p1:(OR (GT 3 s8) (GT s5 s2)), p2:(GT s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 2 ms.
FORMULA SwimmingPool-PT-08-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-01 finished in 368 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&(p1||X(F((p1&&F(p0))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:18] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 18:41:18] [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
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-08-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, 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={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s6 s5), p0:(LEQ s7 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 219 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA SwimmingPool-PT-08-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-03 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(G(p1))))||X(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SwimmingPool-PT-08-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s3), p1:(LEQ s6 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-08-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property SwimmingPool-PT-08-04 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 18:41:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-08-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s0 s2) (LEQ s5 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 134 ms.
Stack based approach found an accepted trace after 6871 steps with 0 reset with depth 6872 and stack size 6520 in 21 ms.
FORMULA SwimmingPool-PT-08-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-06 finished in 262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X((p0 U (p1||G(p0))))&&(p2||F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), p0, (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : SwimmingPool-PT-08-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s2 s6), p0:(GT s1 s0), p1:(AND (LEQ 1 s6) (GT s1 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-08-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-07 finished in 213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 5 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-17 18:41:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-08-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s5), p0:(GT s2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 101 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SwimmingPool-PT-08-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-08 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G((F(p1)&&F(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-08-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s5), p1:(LEQ s6 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 92 ms.
Stack based approach found an accepted trace after 143 steps with 0 reset with depth 144 and stack size 144 in 1 ms.
FORMULA SwimmingPool-PT-08-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-09 finished in 288 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F((F(!p1)&&X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:20] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:20] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 18:41:20] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (NOT p0), p1, (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-08-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1 s7), p1:(GT s6 s2), p2:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 84 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA SwimmingPool-PT-08-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-10 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0)&&F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:41:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:20] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:20] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 18:41:20] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:20] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-08-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s5), p1:(GT 2 s4), p2:(LEQ s8 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5692 reset in 76 ms.
Product exploration explored 100000 steps with 5683 reset in 83 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5697 reset in 68 ms.
Product exploration explored 100000 steps with 5665 reset in 76 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 114 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 18:41:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 6527 reset in 160 ms.
Product exploration explored 100000 steps with 6588 reset in 126 ms.
[2021-05-17 18:41:21] [INFO ] Flatten gal took : 2 ms
[2021-05-17 18:41:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:41:21] [INFO ] Time to serialize gal into /tmp/LTL8255671288326624159.gal : 1 ms
[2021-05-17 18:41:21] [INFO ] Time to serialize properties into /tmp/LTL15211529055766194739.ltl : 15 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8255671288326624159.gal, -t, CGAL, -LTL, /tmp/LTL15211529055766194739.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8255671288326624159.gal -t CGAL -LTL /tmp/LTL15211529055766194739.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(Dressed>=1)"))&&(F(("(Dress<2)")||(G("(Bags<=InBath)")))))))
Formula 0 simplified : !X(F"(Dressed>=1)" & F("(Dress<2)" | G"(Bags<=InBath)"))
Detected timeout of ITS tools.
[2021-05-17 18:41:36] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:41:36] [INFO ] Applying decomposition
[2021-05-17 18:41:36] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3204063773398442013.txt, -o, /tmp/graph3204063773398442013.bin, -w, /tmp/graph3204063773398442013.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3204063773398442013.bin, -l, -1, -v, -w, /tmp/graph3204063773398442013.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:41:36] [INFO ] Decomposing Gal with order
[2021-05-17 18:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:41:36] [INFO ] Flatten gal took : 24 ms
[2021-05-17 18:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 18:41:36] [INFO ] Time to serialize gal into /tmp/LTL1514960321498041536.gal : 1 ms
[2021-05-17 18:41:36] [INFO ] Time to serialize properties into /tmp/LTL8848636401316696834.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1514960321498041536.gal, -t, CGAL, -LTL, /tmp/LTL8848636401316696834.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1514960321498041536.gal -t CGAL -LTL /tmp/LTL8848636401316696834.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(gi0.gu3.Dressed>=1)"))&&(F(("(gi0.gu3.Dress<2)")||(G("(gu2.Bags<=gu2.InBath)")))))))
Formula 0 simplified : !X(F"(gi0.gu3.Dressed>=1)" & F("(gi0.gu3.Dress<2)" | G"(gu2.Bags<=gu2.InBath)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14267249544910872842
[2021-05-17 18:41:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14267249544910872842
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14267249544910872842]
Compilation finished in 161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14267249544910872842]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14267249544910872842]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-08-11 finished in 46398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G((p0||X(!p1)))) U G(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:42:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:42:06] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:42:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:42:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:42:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:42:06] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, p1, (AND (NOT p0) p1), p1, true]
Running random walk in product with property : SwimmingPool-PT-08-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s6 s2), p0:(LEQ s6 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-08-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-12 finished in 177 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((X(p1) U G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 18:42:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:42:06] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:42:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:42:07] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 18:42:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 18:42:07] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : SwimmingPool-PT-08-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s7 s2), p2:(LEQ s0 s2), p1:(LEQ s6 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-08-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-08-13 finished in 194 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-17 18:42:07] [INFO ] Applying decomposition
[2021-05-17 18:42:07] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin7078885449357655822
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5960901074846949151.txt, -o, /tmp/graph5960901074846949151.bin, -w, /tmp/graph5960901074846949151.weights], workingDir=null]
[2021-05-17 18:42:07] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 18:42:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:42:07] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 18:42:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5960901074846949151.bin, -l, -1, -v, -w, /tmp/graph5960901074846949151.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:42:07] [INFO ] Decomposing Gal with order
[2021-05-17 18:42:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:42:07] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 18:42:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 18:42:07] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:42:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 18:42:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7078885449357655822
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7078885449357655822]
[2021-05-17 18:42:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality8222171430286756460.gal : 1 ms
[2021-05-17 18:42:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality3956218867898601690.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality8222171430286756460.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3956218867898601690.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality8222171430286756460.gal -t CGAL -LTL /tmp/LTLCardinality3956218867898601690.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(gi0.gu1.Dressed>=1)"))&&(F(("(gi0.gu1.Dress<2)")||(G("(gu2.Bags<=gu2.InBath)")))))))
Formula 0 simplified : !X(F"(gi0.gu1.Dressed>=1)" & F("(gi0.gu1.Dress<2)" | G"(gu2.Bags<=gu2.InBath)"))
Compilation finished in 124 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7078885449357655822]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>(!(LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7078885449357655822]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: X((<>(!(LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: "X((<>(!(LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.039: State length is 10, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.039: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.039: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.039: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.039: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.155: [Blue] ~71 levels ~960 states ~1920 transitions
pins2lts-mc-linux64( 0/ 8), 0.158: [Blue] ~132 levels ~1920 states ~3920 transitions
pins2lts-mc-linux64( 0/ 8), 0.159: [Blue] ~264 levels ~3840 states ~7272 transitions
pins2lts-mc-linux64( 0/ 8), 0.161: [Blue] ~532 levels ~7680 states ~12984 transitions
pins2lts-mc-linux64( 0/ 8), 0.163: [Blue] ~598 levels ~15360 states ~25512 transitions
pins2lts-mc-linux64( 3/ 8), 0.165: [Blue] ~602 levels ~30720 states ~58504 transitions
pins2lts-mc-linux64( 3/ 8), 0.183: [Blue] ~602 levels ~61440 states ~118712 transitions
pins2lts-mc-linux64( 3/ 8), 0.209: [Blue] ~602 levels ~122880 states ~242504 transitions
pins2lts-mc-linux64( 3/ 8), 0.260: [Blue] ~602 levels ~245760 states ~492952 transitions
pins2lts-mc-linux64( 3/ 8), 0.374: [Blue] ~602 levels ~491520 states ~996640 transitions
pins2lts-mc-linux64( 5/ 8), 0.646: [Blue] ~602 levels ~983040 states ~2278792 transitions
pins2lts-mc-linux64( 1/ 8), 1.192: [Blue] ~601 levels ~1966080 states ~4585544 transitions
pins2lts-mc-linux64( 0/ 8), 2.253: [Blue] ~600 levels ~3932160 states ~9405536 transitions
pins2lts-mc-linux64( 1/ 8), 4.132: [Blue] ~601 levels ~7864320 states ~19968440 transitions
pins2lts-mc-linux64( 4/ 8), 8.400: [Blue] ~602 levels ~15728640 states ~37887152 transitions
pins2lts-mc-linux64( 3/ 8), 18.221: [Blue] ~602 levels ~31457280 states ~79509280 transitions
pins2lts-mc-linux64( 4/ 8), 38.031: [Blue] ~602 levels ~62914560 states ~174822624 transitions
pins2lts-mc-linux64( 4/ 8), 79.929: [Blue] ~602 levels ~125829120 states ~358355416 transitions
pins2lts-mc-linux64( 4/ 8), 111.225: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 111.243:
pins2lts-mc-linux64( 0/ 8), 111.243: Explored 145252306 states 436579145 transitions, fanout: 3.006
pins2lts-mc-linux64( 0/ 8), 111.243: Total exploration time 111.190 sec (111.150 sec minimum, 111.171 sec on average)
pins2lts-mc-linux64( 0/ 8), 111.243: States per second: 1306343, Transitions per second: 3926424
pins2lts-mc-linux64( 0/ 8), 111.243:
pins2lts-mc-linux64( 0/ 8), 111.243: State space has 134216934 states, 103425996 are accepting
pins2lts-mc-linux64( 0/ 8), 111.243: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 111.243: blue states: 145252306 (108.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 111.243: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 111.243: all-red states: 103425996 (77.06%), bogus 7243916 (5.40%)
pins2lts-mc-linux64( 0/ 8), 111.243:
pins2lts-mc-linux64( 0/ 8), 111.243: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 111.243:
pins2lts-mc-linux64( 0/ 8), 111.243: Queue width: 8B, total height: 4812, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 111.243: Tree memory: 1137.0MB, 8.9 B/state, compr.: 21.2%
pins2lts-mc-linux64( 0/ 8), 111.243: Tree fill ratio (roots/leafs): 99.0%/44.0%
pins2lts-mc-linux64( 0/ 8), 111.243: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 111.243: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 111.243: Est. total memory use: 1137.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>(!(LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7078885449357655822]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>(!(LTLAPp0==true))&&<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7078885449357655822]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 19:02:23] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:02:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality3560222771344321333.gal : 0 ms
[2021-05-17 19:02:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality4358067308838997619.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality3560222771344321333.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4358067308838997619.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality3560222771344321333.gal -t CGAL -LTL /tmp/LTLCardinality4358067308838997619.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(Dressed>=1)"))&&(F(("(Dress<2)")||(G("(Bags<=InBath)")))))))
Formula 0 simplified : !X(F"(Dressed>=1)" & F("(Dress<2)" | G"(Bags<=InBath)"))
Detected timeout of ITS tools.
[2021-05-17 19:22:39] [INFO ] Flatten gal took : 1 ms
[2021-05-17 19:22:39] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 19:22:39] [INFO ] Transformed 9 places.
[2021-05-17 19:22:39] [INFO ] Transformed 7 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 19:22:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality9135233465051445598.gal : 0 ms
[2021-05-17 19:22:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality8351275406242455468.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality9135233465051445598.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8351275406242455468.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality9135233465051445598.gal -t CGAL -LTL /tmp/LTLCardinality8351275406242455468.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(Dressed>=1)"))&&(F(("(Dress<2)")||(G("(Bags<=InBath)")))))))
Formula 0 simplified : !X(F"(Dressed>=1)" & F("(Dress<2)" | G"(Bags<=InBath)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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