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-162106746400724.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-02-00
FORMULA_NAME SwimmingPool-PT-02-01
FORMULA_NAME SwimmingPool-PT-02-02
FORMULA_NAME SwimmingPool-PT-02-03
FORMULA_NAME SwimmingPool-PT-02-04
FORMULA_NAME SwimmingPool-PT-02-05
FORMULA_NAME SwimmingPool-PT-02-06
FORMULA_NAME SwimmingPool-PT-02-07
FORMULA_NAME SwimmingPool-PT-02-08
FORMULA_NAME SwimmingPool-PT-02-09
FORMULA_NAME SwimmingPool-PT-02-10
FORMULA_NAME SwimmingPool-PT-02-11
FORMULA_NAME SwimmingPool-PT-02-12
FORMULA_NAME SwimmingPool-PT-02-13
FORMULA_NAME SwimmingPool-PT-02-14
FORMULA_NAME SwimmingPool-PT-02-15

=== Now, execution of the tool begins

BK_START 1621269253155

Running Version 0
[2021-05-17 16:34:15] [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 16:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:34:15] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-17 16:34:15] [INFO ] Transformed 9 places.
[2021-05-17 16:34:15] [INFO ] Transformed 7 transitions.
[2021-05-17 16:34:15] [INFO ] Parsed PT model containing 9 places and 7 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:34:15] [INFO ] Initial state test concluded for 1 properties.
FORMULA SwimmingPool-PT-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-02 TRUE 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 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 16:34:15] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 16:34:15] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:15] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:34:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:15] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:15] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 16:34:15] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 16:34:15] [INFO ] Flatten gal took : 17 ms
FORMULA SwimmingPool-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:34:15] [INFO ] Flatten gal took : 3 ms
[2021-05-17 16:34:15] [INFO ] Input system was already deterministic with 7 transitions.
Incomplete random walk after 100006 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=1123 ) properties (out of 18) seen :16
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 16:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 16:34:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-17 16:34:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 16:34:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2021-05-17 16:34:15] [INFO ] Initial state test concluded for 1 properties.
FORMULA SwimmingPool-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||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 16:34:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:15] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:15] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:34:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : SwimmingPool-PT-02-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT 2 s8), p0:(GT s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 430 steps with 0 reset in 9 ms.
FORMULA SwimmingPool-PT-02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-01 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(X(F(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 16:34:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:16] [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 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-02-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s7 s8), p1:(LEQ 2 s4)], 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][false, false, false]]
Product exploration explored 100000 steps with 2557 reset in 201 ms.
Stack based approach found an accepted trace after 42 steps with 1 reset with depth 17 and stack size 17 in 1 ms.
FORMULA SwimmingPool-PT-02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-03 finished in 339 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], 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.
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 16:34:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:16] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-02-05 automaton TGBA [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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT s2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-05 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], 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.
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 9 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:16] [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.
[2021-05-17 16:34:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-17 16:34:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-02-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:(GT s5 s2)], 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 174 reset in 124 ms.
Stack based approach found an accepted trace after 165 steps with 0 reset with depth 166 and stack size 156 in 1 ms.
FORMULA SwimmingPool-PT-02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-06 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((((p0 U (p1||G(p0)))&&X(p2))||G(p3)))))], 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 16:34:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:34:16] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:16] [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 167 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : SwimmingPool-PT-02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={1} source=1 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p3 p1 (NOT p2)) (AND p3 p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={1} source=3 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT 2 s7) (GT s8 s1)), p0:(GT 2 s7), p3:(OR (GT 2 s7) (AND (GT 2 s7) (GT s8 s1))), p2:(GT 1 s1)], nbAcceptance=2, 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 134 reset in 228 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA SwimmingPool-PT-02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-08 finished in 460 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(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 2 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 16:34:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:17] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:17] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-17 16:34:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:17] [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 79 ms :[(AND (NOT p0) p1), p1, p1]
Running random walk in product with property : SwimmingPool-PT-02-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s6 s3), p1:(GT s7 s8)], 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 87 reset in 98 ms.
Stack based approach found an accepted trace after 26812 steps with 21 reset with depth 1614 and stack size 1601 in 38 ms.
FORMULA SwimmingPool-PT-02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-09 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0 U (p1||G(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 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 16:34:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:17] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 16:34:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:17] [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 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT 2 s6) (GT s1 s7)), p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 149 reset in 101 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 0 ms.
FORMULA SwimmingPool-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-10 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 5 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:17] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:34:17] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-17 16:34:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:34:17] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 16:34:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-02-13 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:(LEQ s6 s2), p0:(OR (LEQ 1 s0) (AND (GT s5 s0) (GT s0 s2)))], 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 889 reset in 107 ms.
Product exploration explored 100000 steps with 1023 reset in 115 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 970 reset in 84 ms.
Product exploration explored 100000 steps with 1014 reset in 107 ms.
[2021-05-17 16:34:18] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:34:18] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:34:18] [INFO ] Time to serialize gal into /tmp/LTL9370266000579710541.gal : 1 ms
[2021-05-17 16:34:18] [INFO ] Time to serialize properties into /tmp/LTL6118909601965408188.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/LTL9370266000579710541.gal, -t, CGAL, -LTL, /tmp/LTL6118909601965408188.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/LTL9370266000579710541.gal -t CGAL -LTL /tmp/LTL6118909601965408188.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((("(Entered>=1)")||(G("(Cabins<=Undress)")))||("((Out>Entered)&&(Entered>Undress))")))))
Formula 0 simplified : !GF("((Out>Entered)&&(Entered>Undress))" | "(Entered>=1)" | G"(Cabins<=Undress)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 16:34:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:34:33] [INFO ] Applying decomposition
[2021-05-17 16:34:33] [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/graph13112058853906872263.txt, -o, /tmp/graph13112058853906872263.bin, -w, /tmp/graph13112058853906872263.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/graph13112058853906872263.bin, -l, -1, -v, -w, /tmp/graph13112058853906872263.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:34:33] [INFO ] Decomposing Gal with order
[2021-05-17 16:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:34:33] [INFO ] Flatten gal took : 100 ms
[2021-05-17 16:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 16:34:33] [INFO ] Time to serialize gal into /tmp/LTL13633222344763576388.gal : 1 ms
[2021-05-17 16:34:33] [INFO ] Time to serialize properties into /tmp/LTL10712447804216511346.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/LTL13633222344763576388.gal, -t, CGAL, -LTL, /tmp/LTL10712447804216511346.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/LTL13633222344763576388.gal -t CGAL -LTL /tmp/LTL10712447804216511346.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((("(gu0.Entered>=1)")||(G("(gi1.gu2.Cabins<=gi1.gu2.Undress)")))||("((gu0.Out>gu0.Entered)&&(gu0.Entered>gi1.gu2.Undress))")))))
Formula 0 simplified : !GF("((gu0.Out>gu0.Entered)&&(gu0.Entered>gi1.gu2.Undress))" | "(gu0.Entered>=1)" | G"(gi1.gu2.Cabins<=gi1.gu2.Undress)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
710 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.10919,139228,1,0,592,606015,40,120,502,696501,1355
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SwimmingPool-PT-02-13 finished in 23752 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(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 16:34:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:41] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:34:41] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:34:41] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:34:41] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-02-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GT s5 s2), p1:(GT 1 s6)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-02-15 finished in 244 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621269282896

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

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