About the Execution of ITS-Tools for RobotManipulation-PT-00050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
326.140 | 7188.00 | 13465.00 | 83.40 | FFFFFFFFTFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2022-input.r204-oct2-165281598700043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RobotManipulation-PT-00050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598700043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 8.3K Apr 29 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652943916799
Running Version 202205111006
[2022-05-19 07:05: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]
[2022-05-19 07:05:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:05:18] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2022-05-19 07:05:18] [INFO ] Transformed 15 places.
[2022-05-19 07:05:18] [INFO ] Transformed 11 transitions.
[2022-05-19 07:05:18] [INFO ] Parsed PT model containing 15 places and 11 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-00050-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 7 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:18] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-19 07:05:18] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:18] [INFO ] Computed 6 place invariants in 16 ms
[2022-05-19 07:05:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 07:05:18] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2022-05-19 07:05:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 07:05:18] [INFO ] Flatten gal took : 17 ms
FORMULA RobotManipulation-PT-00050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 07:05:18] [INFO ] Flatten gal took : 3 ms
[2022-05-19 07:05:18] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:18] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 07:05:18] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:05:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 07:05:18] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:05:18] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA RobotManipulation-PT-00050-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X((p1 U F(p0)))&&G(X(p1)))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:19] [INFO ] Implicit Places using invariants in 252 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 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}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p0:(LEQ 1 s10), p1:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-00 finished in 689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U G(X((X(p1) U p2))))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:05:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-19 07:05:19] [INFO ] Implicit Places using invariants in 42 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 252 ms :[p2, p2, p2, (AND p0 p2), (AND p2 p1), (AND p0 p2), (AND p0 p2 p1)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 p2 p1), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s5 s9), p2:(LEQ s6 s5), p1:(LEQ s7 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 64 reset in 327 ms.
Stack based approach found an accepted trace after 170 steps with 0 reset with depth 171 and stack size 170 in 0 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-01 finished in 662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!(X(p0) U !X(X((G(!p0)||p1))))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:05:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:05:20] [INFO ] Implicit Places using invariants in 20 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(GT s6 s9), p1:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-04 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U G(p1))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
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 3 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 9 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-19 07:05:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:20] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 8/11 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 7
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 7
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-19 07:05:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-19 07:05:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:05:20] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 7/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[p1, p1]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5 s3), p1:(LEQ s0 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 3 reset in 234 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 1 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-05 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G((p1 U p2)))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:21] [INFO ] Implicit Places using invariants in 20 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 3 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:05:21] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 2 s6), p1:(GT s7 s9), p0:(GT 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1550 reset in 137 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-06 finished in 654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(X(p0)))&&F(G(p1))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:21] [INFO ] Implicit Places using invariants in 39 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s2 s8), p1:(LEQ s2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], 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 RobotManipulation-PT-00050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-09 finished in 191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(X(p1))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants in 29 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LEQ 2 s2) (LEQ s3 s5)), p0:(GT s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-00050-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00050-LTLCardinality-10 finished in 529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants in 60 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s13), p1:(LEQ 3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5423 reset in 97 ms.
Stack based approach found an accepted trace after 592 steps with 27 reset with depth 22 and stack size 22 in 0 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-11 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G((G(p0)&&p0))))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
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 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 2 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-19 07:05:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants in 40 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/15 places, 6/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4 transition count 6
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 07:05:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 07:05:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:05:22] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 6/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-12 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:05:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants in 23 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s8 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 40 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-00050-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00050-LTLCardinality-13 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(X(p0)) U (p0 U p1)) U p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 s3), p1:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-14 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&(X(p1)||p0))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants in 35 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 07:05:23] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s7 s5), p1:(LEQ s5 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-LTLCardinality-15 finished in 239 ms.
All properties solved by simple procedures.
Total runtime 5929 ms.
BK_STOP 1652943923987
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-00050"
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 RobotManipulation-PT-00050, 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 r204-oct2-165281598700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00050.tgz
mv RobotManipulation-PT-00050 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 '
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 ;