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-165281598800084.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-02000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598800084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.9K Apr 29 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:31 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 4.0K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K 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-02000-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652945712945

Running Version 202205111006
[2022-05-19 07:35: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]
[2022-05-19 07:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:35:14] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2022-05-19 07:35:14] [INFO ] Transformed 15 places.
[2022-05-19 07:35:14] [INFO ] Transformed 11 transitions.
[2022-05-19 07:35:14] [INFO ] Parsed PT model containing 15 places and 11 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-02000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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 7 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:35:14] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-19 07:35:14] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:35:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 07:35:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:35:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 07:35:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 11/11 transitions.
Support contains 13 out of 14 places after structural reductions.
[2022-05-19 07:35:14] [INFO ] Flatten gal took : 11 ms
[2022-05-19 07:35:14] [INFO ] Flatten gal took : 3 ms
[2022-05-19 07:35:14] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=571 ) properties (out of 16) seen :4
Finished Best-First random walk after 472 steps, including 0 resets, run visited all 12 properties in 10 ms. (steps per millisecond=47 )
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(((F(p1)||G(p2))&&p0)))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:35:14] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:35:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:35:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}]], initial=2, aps=[p1:(OR (LT s7 1) (LT s10 1)), p2:(LT s11 1), p0:(AND (GEQ s3 1) (GEQ s5 1))], 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 1 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-00 finished in 432 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(G(p0)))&&G(p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:15] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 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/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s3 1) (LT s5 1)), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 146 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-02000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-01 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&(G((X(p2)||p0)) U p0)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:15] [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/14 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:35:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:35:15] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s6 1), p0:(GEQ s9 1), p2:(OR (GEQ s6 1) (AND (GEQ s0 1) (GEQ s4 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15122 reset in 111 ms.
Product exploration explored 100000 steps with 15004 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p2), (X (AND p0 p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 11 factoid took 424 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1), true]
Finished random walk after 4002 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2001 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p2), (X (AND p0 p2)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 11 factoid took 364 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1), true]
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:17] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 07:35:17] [INFO ] Computed and/alt/rep : 9/10/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:17] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:35:17] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:17] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-19 07:35:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), true]
Finished random walk after 4002 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2001 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1), true]
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 07:35:17] [INFO ] Computed and/alt/rep : 9/10/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:17] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 15056 reset in 70 ms.
Product exploration explored 100000 steps with 15119 reset in 64 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1), true]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 10 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 10 transition count 10
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 8 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 9 rules in 11 ms. Remains 8 /10 variables (removed 2) and now considering 8/10 (removed 2) transitions.
[2022-05-19 07:35:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-19 07:35:18] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-19 07:35:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/10 places, 8/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/10 places, 8/10 transitions.
Product exploration explored 100000 steps with 25001 reset in 117 ms.
Product exploration explored 100000 steps with 24935 reset in 89 ms.
Built C files in :
/tmp/ltsmin13676858713766988848
[2022-05-19 07:35:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13676858713766988848
Running compilation step : cd /tmp/ltsmin13676858713766988848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin13676858713766988848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13676858713766988848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18276919626850148984.hoa' '--buchi-type=spotba'
LTSmin run took 820 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-LTLFireability-02 finished in 3905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 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 4 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 5 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 3 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-19 07:35:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants in 25 ms returned [4, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/14 places, 7/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 4 transition count 4
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 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 2 transition count 2
Applied a total of 9 rules in 4 ms. Remains 2 /6 variables (removed 4) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-19 07:35:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-19 07:35:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/14 places, 2/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/14 places, 2/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1)], 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 277 reset in 86 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 4 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-03 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 13 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 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 5 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 7 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 11 place count 8 transition count 6
Applied a total of 11 rules in 5 ms. Remains 8 /14 variables (removed 6) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-19 07:35:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants in 20 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/14 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 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 7 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 07:35:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 07:35:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/14 places, 3/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/14 places, 3/11 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT 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 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-04 finished in 111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((!(p0 U p1)||X(!p1)||G(p2))))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 7 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:35:19] [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/14 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 1 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:35:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:35:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(GEQ s5 1), p0:(GEQ s6 1), p2:(OR (LT s0 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 22 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-05 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 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:35:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:35:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s5 1))], 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 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 84 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-02000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-02000-LTLFireability-06 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 29 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 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 2 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:35:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s9 1)], 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 1 reset in 77 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-07 finished in 206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0)) U (G((G(X(p0))||p1))||p0))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 25 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 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 2 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:35:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:35:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1)), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54073 steps with 0 reset in 45 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-08 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 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 11 place count 8 transition count 6
Applied a total of 11 rules in 13 ms. Remains 8 /14 variables (removed 6) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-19 07:35:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 23 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/14 places, 6/11 transitions.
Graph (trivial) has 2 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 07:35:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 07:35:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:35:20] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/14 places, 5/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/14 places, 5/11 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-02000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-02000-LTLFireability-09 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U F(p0)) U G(((G(p2)&&p1) U X(X(p3))))))'
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:35:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:35:21] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:35:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:35:21] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:35:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:35:21] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 648 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) p3), false]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={0, 1} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 7}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 8}, { cond=true, acceptance={0} source=2 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND p1 p2), acceptance={1} source=2 dest: 11}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 8}, { cond=(NOT p2), acceptance={0} source=4 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 10}, { cond=p2, acceptance={1} source=4 dest: 11}, { cond=p2, acceptance={} source=4 dest: 14}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=5 dest: 7}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 8}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND p1 p2), acceptance={1} source=5 dest: 11}, { cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=8 dest: 8}, { cond=(NOT p3), acceptance={0} source=8 dest: 9}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 10}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=8 dest: 11}, { cond=(AND p1 p2 (NOT p3)), acceptance={0, 1} source=8 dest: 12}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=9 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=9 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={0, 1} source=9 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p2 (NOT p3)), acceptance={1} source=11 dest: 11}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 14}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=12 dest: 7}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=12 dest: 8}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=12 dest: 10}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=12 dest: 11}, { cond=(AND p1 p2 (NOT p3)), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 15}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 16}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=14 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=14 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=14 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=14 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={1} source=14 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 17}], [{ cond=(NOT p0), acceptance={0, 1} source=15 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=16 dest: 15}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=17 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=17 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=17 dest: 2}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=17 dest: 3}, { cond=(AND p2 p3), acceptance={1} source=17 dest: 4}, { cond=(AND p2 p3), acceptance={} source=17 dest: 17}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s5 1)), p0:(AND (GEQ s1 1) (GEQ s5 1)), p2:(AND (GEQ s7 1) (GEQ s11 1)), p3:(AND (GEQ s2 1) (GEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5314 reset in 71 ms.
Stack based approach found an accepted trace after 51 steps with 2 reset with depth 29 and stack size 29 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-10 finished in 857 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants in 20 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 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 2 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:35:22] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:35:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s5 1)), p0:(OR (LT s8 1) (LT s3 1) (LT s5 1) (LT s1 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 48 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 p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-02000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-02000-LTLFireability-12 finished in 359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(!(G(p0) U F(p1)))) U p2)))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:35:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 128 ms :[p1, (NOT p2), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s9 1), p2:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s7 1) (GEQ s10 1)))], 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 30 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-14 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 13 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 11 transition count 9
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 9 place count 9 transition count 7
Applied a total of 9 rules in 1 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-19 07:35:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants in 31 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/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 6 transition count 7
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-19 07:35:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-19 07:35:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:35:22] [INFO ] Implicit Places using invariants and state equation in 34 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 : 6/14 places, 7/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s4 1), p1:(AND (OR (LT s0 1) (LT s3 1)) (LT s4 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][true, true, true, true]]
Product exploration explored 100000 steps with 10316 reset in 49 ms.
Stack based approach found an accepted trace after 14 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-15 finished in 291 ms.
All properties solved by simple procedures.
Total runtime 9008 ms.

BK_STOP 1652945723032

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-02000"
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-02000, 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 r204-oct2-165281598800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-02000.tgz
mv RobotManipulation-PT-02000 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 ;