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.r197-smll-162089451900109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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-10000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451900109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.3K May 5 16:51 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-10000-00
FORMULA_NAME RobotManipulation-PT-10000-01
FORMULA_NAME RobotManipulation-PT-10000-02
FORMULA_NAME RobotManipulation-PT-10000-03
FORMULA_NAME RobotManipulation-PT-10000-04
FORMULA_NAME RobotManipulation-PT-10000-05
FORMULA_NAME RobotManipulation-PT-10000-06
FORMULA_NAME RobotManipulation-PT-10000-07
FORMULA_NAME RobotManipulation-PT-10000-08
FORMULA_NAME RobotManipulation-PT-10000-09
FORMULA_NAME RobotManipulation-PT-10000-10
FORMULA_NAME RobotManipulation-PT-10000-11
FORMULA_NAME RobotManipulation-PT-10000-12
FORMULA_NAME RobotManipulation-PT-10000-13
FORMULA_NAME RobotManipulation-PT-10000-14
FORMULA_NAME RobotManipulation-PT-10000-15

=== Now, execution of the tool begins

BK_START 1620998710029

Running Version 0
[2021-05-14 13:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 13:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 13:25:13] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-14 13:25:13] [INFO ] Transformed 15 places.
[2021-05-14 13:25:13] [INFO ] Transformed 11 transitions.
[2021-05-14 13:25:13] [INFO ] Parsed PT model containing 15 places and 11 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 13:25:13] [INFO ] Initial state test concluded for 3 properties.
FORMULA RobotManipulation-PT-10000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 10 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:25:13] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-14 13:25:13] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:25:13] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 13:25:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:25:13] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 13:25:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 13:25:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 13:25:13] [INFO ] Flatten gal took : 29 ms
FORMULA RobotManipulation-PT-10000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 13:25:14] [INFO ] Flatten gal took : 8 ms
[2021-05-14 13:25:14] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100010 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=1428 ) properties (out of 14) seen :5
Running SMT prover for 9 properties.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:25:14] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 13:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:25:14] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 13:25:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:25:15] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:25:15] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
[2021-05-14 13:25:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:25:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:25:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:25:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:25:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 13:25:15] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:25:15] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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 9 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 13:25:15] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 13:25:15] [INFO ] Implicit Places using invariants in 48 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:25:15] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, 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 4 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:25:15] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:25:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:25:15] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-14 13:25:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-10000-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 8 ms.
FORMULA RobotManipulation-PT-10000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-00 finished in 574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 2 rules applied. Total rules applied 2 place count 14 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 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
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 7 place count 11 transition count 8
Applied a total of 7 rules in 15 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-14 13:25:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 13:25:15] [INFO ] Implicit Places using invariants in 42 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
[2021-05-14 13:25:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 13:25:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, 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
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 4 place count 7 transition count 6
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-14 13:25:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:25:15] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-14 13:25:15] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-14 13:25:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-10000-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1)), p2:(GEQ s3 1), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 470 ms.
Product exploration explored 100000 steps with 0 reset in 407 ms.
Knowledge obtained : [(NOT p0), (NOT p2), p1]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 283 ms.
[2021-05-14 13:25:18] [INFO ] Flatten gal took : 3 ms
[2021-05-14 13:25:18] [INFO ] Flatten gal took : 2 ms
[2021-05-14 13:25:18] [INFO ] Time to serialize gal into /tmp/LTL12387852225288382735.gal : 2 ms
[2021-05-14 13:25:18] [INFO ] Time to serialize properties into /tmp/LTL14898610621644402889.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/LTL12387852225288382735.gal, -t, CGAL, -LTL, /tmp/LTL14898610621644402889.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/LTL12387852225288382735.gal -t CGAL -LTL /tmp/LTL14898610621644402889.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((initialized>=1)&&(p_i2>=1))"))&&(G(("(p_i1>=1)")||(G("(p_rdy>=1)"))))))
Formula 0 simplified : !(F"((initialized>=1)&&(p_i2>=1))" & G("(p_i1>=1)" | G"(p_rdy>=1)"))
Detected timeout of ITS tools.
[2021-05-14 13:25:33] [INFO ] Flatten gal took : 2 ms
[2021-05-14 13:25:33] [INFO ] Applying decomposition
[2021-05-14 13:25: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/graph12185848377096517758.txt, -o, /tmp/graph12185848377096517758.bin, -w, /tmp/graph12185848377096517758.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/graph12185848377096517758.bin, -l, -1, -v, -w, /tmp/graph12185848377096517758.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:25:33] [INFO ] Decomposing Gal with order
[2021-05-14 13:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:25:33] [INFO ] Flatten gal took : 74 ms
[2021-05-14 13:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 13:25:33] [INFO ] Time to serialize gal into /tmp/LTL11265907087932867352.gal : 1 ms
[2021-05-14 13:25:33] [INFO ] Time to serialize properties into /tmp/LTL9567544302806859428.ltl : 0 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/LTL11265907087932867352.gal, -t, CGAL, -LTL, /tmp/LTL9567544302806859428.ltl, -c, -stutter-deadlock], 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/LTL11265907087932867352.gal -t CGAL -LTL /tmp/LTL9567544302806859428.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((u2.initialized>=1)&&(u0.p_i2>=1))"))&&(G(("(u0.p_i1>=1)")||(G("(u1.p_rdy>=1)"))))))
Formula 0 simplified : !(F"((u2.initialized>=1)&&(u0.p_i2>=1))" & G("(u0.p_i1>=1)" | G"(u1.p_rdy>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8142052843840034915
[2021-05-14 13:25:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8142052843840034915
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/ltsmin8142052843840034915]
Compilation finished in 304 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8142052843840034915]
Link finished in 46 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, (<>((LTLAPp0==true))&&[](((LTLAPp1==true)||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8142052843840034915]
LTSmin run took 620 ms.
FORMULA RobotManipulation-PT-10000-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-01 finished in 33585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:25:49] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:49] [INFO ] Implicit Places using invariants in 42 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:25:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:25:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:25:49] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:25:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s8 1), p1:(GEQ s6 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3284 reset in 328 ms.
Stack based approach found an accepted trace after 52 steps with 2 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RobotManipulation-PT-10000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-03 finished in 600 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G((p1&&F(!p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 3 rules applied. Total rules applied 3 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 3 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-14 13:25:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 13:25:49] [INFO ] Implicit Places using invariants in 29 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
[2021-05-14 13:25:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-14 13:25:50] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 10/15 places, 9/11 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 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
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 4 place count 8 transition count 7
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 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 7
Applied a total of 6 rules in 9 ms. Remains 7 /10 variables (removed 3) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 13:25:50] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 13:25:50] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : RobotManipulation-PT-10000-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s3 1), p0:(AND (LT s3 1) (OR (LT s5 1) (LT s6 1))), p2:(AND (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RobotManipulation-PT-10000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-04 finished in 501 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)||(!p2 U (p3||G(!p2)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
Applied a total of 3 rules in 7 ms. Remains 13 /15 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-14 13:25:50] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-14 13:25:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2021-05-14 13:25:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-14 13:25:50] [INFO ] Computed 5 place invariants in 13 ms
[2021-05-14 13:25:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) p2 (NOT p3)), true, (NOT p0), (NOT p1), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : RobotManipulation-PT-10000-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s12 1)), p0:(OR (LT s7 1) (LT s9 1)), p3:(AND (LT s10 1) (OR (LT s1 1) (LT s5 1))), p2:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-06 finished in 408 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&G(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
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 5 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 4 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-14 13:25:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants in 27 ms returned [4, 9, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
[2021-05-14 13:25:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-14 13:25:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 8/11 transitions.
Graph (trivial) has 4 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 5
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 3 place count 5 transition count 5
Applied a total of 3 rules in 8 ms. Remains 5 /8 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 13:25:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 13:25:50] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:25:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, true, (NOT p1), p1, p1]
Running random walk in product with property : RobotManipulation-PT-10000-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s4 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-07 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:25:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 13:25:51] [INFO ] Implicit Places using invariants in 23 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:25:51] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:25:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8 1)], 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]]
Product exploration explored 100000 steps with 3036 reset in 211 ms.
Stack based approach found an accepted trace after 141 steps with 4 reset with depth 16 and stack size 16 in 1 ms.
FORMULA RobotManipulation-PT-10000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-09 finished in 382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p1 U (p2||G(p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
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 8 place count 10 transition count 8
Applied a total of 8 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 13:25:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:51] [INFO ] Implicit Places using invariants in 16 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-14 13:25:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 13:25:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 9/15 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-14 13:25:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 13:25:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : RobotManipulation-PT-10000-10 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (LT s5 1) (OR (LT s2 1) (LT s4 1) (LT s0 1) (LT s3 1))), p1:(OR (LT s2 1) (LT s4 1) (LT s0 1) (LT s3 1)), p0:(OR (LT s1 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-10 finished in 213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(((!p1||G(p0)||X(!p1))&&X(!p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:25:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 13:25:51] [INFO ] Implicit Places using invariants in 24 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 13:25:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 13:25:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p2), (OR p2 (AND (NOT p0) p1)), (AND (NOT p0) p1), p2, (AND (NOT p0) p1 (NOT p2)), p2, (AND (NOT p0) p2)]
Running random walk in product with property : RobotManipulation-PT-10000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 1}], [{ cond=(AND p0 p1 p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s9 1), p1:(OR (LT s2 1) (LT s8 1)), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2406 reset in 121 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA RobotManipulation-PT-10000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-11 finished in 502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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 3 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-14 13:25:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants in 16 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 17 ms to find 3 implicit places.
[2021-05-14 13:25:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 13:25:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 13:25:52] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 5/15 places, 6/11 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 13:25:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 13:25:52] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-10000-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-12 finished in 106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X((p0&&(p1 U p2)))&&(p0||F(!p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:25:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants in 17 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 13:25:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, 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
[2021-05-14 13:25:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 13:25:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), p2, true, (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-10000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s10 1), p2:(AND (GEQ s0 1) (GEQ s4 1)), p1:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 3 reset in 1 ms.
FORMULA RobotManipulation-PT-10000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-13 finished in 326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&X((!p1&&X((!p1 U (!p2||G(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:25:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants in 19 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 13:25:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:25:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, 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
[2021-05-14 13:25:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 13:25:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:25:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR p1 p0), p0, p1, true, (AND p1 p2)]
Running random walk in product with property : RobotManipulation-PT-10000-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1)), p1:(GEQ s10 1), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-14 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X((G(p1)||G((p2&&F(!p0))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:25:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 13:25:53] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 13:25:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 13:25:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:25:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p1), p0, (OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-10000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 7}]], initial=6, aps=[p1:(OR (LT s2 1) (LT s8 1)), p2:(OR (LT s6 1) (LT s10 1)), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-15 finished in 491 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620998754802

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="RobotManipulation-PT-10000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-10000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-162089451900109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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