Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r359-smll-167891808300004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is RobotManipulation-PT-00001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808300004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.0K Feb 26 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 5 18:23 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-00001-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678985861125

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00001
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 16:57:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 16:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 16:57:44] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-16 16:57:44] [INFO ] Transformed 15 places.
[2023-03-16 16:57:44] [INFO ] Transformed 11 transitions.
[2023-03-16 16:57:44] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-00001-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-00001-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 19 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 16:57:45] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 16:57:45] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-16 16:57:45] [INFO ] Invariant cache hit.
[2023-03-16 16:57:45] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-16 16:57:45] [INFO ] Invariant cache hit.
[2023-03-16 16:57:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 14 out of 15 places after structural reductions.
[2023-03-16 16:57:45] [INFO ] Flatten gal took : 30 ms
[2023-03-16 16:57:45] [INFO ] Flatten gal took : 9 ms
[2023-03-16 16:57:45] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 318 steps, including 0 resets, run visited all 11 properties in 40 ms. (steps per millisecond=7 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(p1)) U p2)||X((p1||(p3&&G(p4))))))'
Support contains 7 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 3 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 16:57:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-16 16:57:46] [INFO ] Implicit Places using invariants in 59 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 6 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 841 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p2) (NOT p4)), (NOT p4)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p3 p4), acceptance={} source=4 dest: 8}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p1) (NOT p3)) (AND (NOT p2) p0 (NOT p1) (NOT p4))), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p3 p4), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1) p3 p4), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p4)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1 p4), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p0 p1 p4), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p4), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p4)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 p4), acceptance={} source=7 dest: 7}], [{ cond=(NOT p4), acceptance={} source=8 dest: 0}, { cond=p4, acceptance={} source=8 dest: 8}]], initial=3, aps=[p1:(AND (GEQ s11 1) (GEQ s12 1)), p2:(AND (GEQ s6 1) (GEQ s9 1)), p0:(LT s5 1), p3:(GEQ s8 1), p4:(GEQ s7 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17757 reset in 571 ms.
Product exploration explored 100000 steps with 17733 reset in 303 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) (NOT p2) p0 (NOT p3) (NOT p4)), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3 p4))), (X (NOT (AND (NOT p2) p0 (NOT p1) p3 p4))), (X (OR (AND (NOT p2) p0 (NOT p1) (NOT p3)) (AND (NOT p2) p0 (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p1) p3 p4))), (X (X (NOT (AND (NOT p2) p0 p4)))), (X (X (NOT (AND (NOT p2) p0 p1 p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p4))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1 p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (AND (NOT p2) p0 (NOT p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p0 p1 (NOT p4)))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1))))]
Knowledge based reduction with 20 factoid took 1623 ms. Reduced automaton from 9 states, 26 edges and 5 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Finished random walk after 364 steps, including 0 resets, run visited all 5 properties in 20 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0 (NOT p3) (NOT p4)), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3 p4))), (X (NOT (AND (NOT p2) p0 (NOT p1) p3 p4))), (X (OR (AND (NOT p2) p0 (NOT p1) (NOT p3)) (AND (NOT p2) p0 (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p1) p3 p4))), (X (X (NOT (AND (NOT p2) p0 p4)))), (X (X (NOT (AND (NOT p2) p0 p1 p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p4))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1 p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (AND (NOT p2) p0 (NOT p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p0 p1 (NOT p4)))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F p1), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 20 factoid took 1692 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 16:57:52] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 16:57:52] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-16 16:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 16:57:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-16 16:57:52] [INFO ] Computed and/alt/rep : 10/13/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 16:57:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 16:57:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 16:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 16:57:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-16 16:57:52] [INFO ] Computed and/alt/rep : 10/13/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 16:57:52] [INFO ] Added : 8 causal constraints over 2 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-16 16:57:52] [INFO ] Invariant cache hit.
[2023-03-16 16:57:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 16:57:52] [INFO ] Invariant cache hit.
[2023-03-16 16:57:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-16 16:57:52] [INFO ] Invariant cache hit.
[2023-03-16 16:57:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 13/13 places, 11/11 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 p0 (NOT p2) (NOT p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Finished random walk after 146 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 359 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
[2023-03-16 16:57:54] [INFO ] Invariant cache hit.
[2023-03-16 16:57:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 16:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 16:57:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 16:57:54] [INFO ] Computed and/alt/rep : 10/13/10 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 16:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 16:57:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 16:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 16:57:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 16:57:54] [INFO ] Computed and/alt/rep : 10/13/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 16:57:54] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 327 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 17775 reset in 313 ms.
Product exploration explored 100000 steps with 17736 reset in 230 ms.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-16 16:57:55] [INFO ] Invariant cache hit.
[2023-03-16 16:57:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-16 16:57:55] [INFO ] Invariant cache hit.
[2023-03-16 16:57:55] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-16 16:57:55] [INFO ] Invariant cache hit.
[2023-03-16 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 13/13 places, 11/11 transitions.
Treatment of property RobotManipulation-PT-00001-LTLFireability-00 finished in 9315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 16:57:55] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 16:57:55] [INFO ] Implicit Places using invariants in 42 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1)), p0:(GEQ s7 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-01 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(!p1))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 16:57:55] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 16:57:56] [INFO ] Implicit Places using invariants in 48 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s8 1)), p1:(AND (GEQ s11 1) (GEQ s12 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 78 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00001-LTLFireability-02 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U ((X(!p0)&&G(p1))||X(G(!p0)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 16:57:56] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 16:57:56] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, p0, (AND (NOT p1) p0), (NOT p1), p0, p0]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(LT s5 1), p0:(AND (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-03 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p0 U p1)||G((p2 U p0))))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 16:57:56] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-16 16:57:56] [INFO ] Implicit Places using invariants in 43 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s10 1) (GEQ s11 1)), p2:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20437 reset in 117 ms.
Product exploration explored 100000 steps with 20464 reset in 108 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 p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) p2)), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))))]
Knowledge based reduction with 7 factoid took 596 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) p2)), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (F p0), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 561 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 11 rows 12 cols
[2023-03-16 16:57:59] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-16 16:57:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 16:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 16:57:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 16:57:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 16:57:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 16:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 16:57:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 16:57:59] [INFO ] Computed and/alt/rep : 10/13/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 16:57:59] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 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.
[2023-03-16 16:57:59] [INFO ] Invariant cache hit.
[2023-03-16 16:57:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:57:59] [INFO ] Invariant cache hit.
[2023-03-16 16:57:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-16 16:57:59] [INFO ] Invariant cache hit.
[2023-03-16 16:57:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 12/12 places, 11/11 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) (NOT p0) (NOT p2)), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 770 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 869 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-16 16:58:01] [INFO ] Invariant cache hit.
[2023-03-16 16:58:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 16:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 16:58:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 16:58:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 16:58:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 16:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 16:58:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 16:58:02] [INFO ] Computed and/alt/rep : 10/13/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 16:58:02] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20474 reset in 127 ms.
Product exploration explored 100000 steps with 20426 reset in 133 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 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 12 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 3 place count 12 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 10 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 8 rules in 14 ms. Remains 10 /12 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2023-03-16 16:58:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:58:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 16:58:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 10/12 places, 9/11 transitions.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-16 16:58:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 16:58:03] [INFO ] Invariant cache hit.
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-16 16:58:03] [INFO ] Invariant cache hit.
[2023-03-16 16:58:03] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 12/12 places, 11/11 transitions.
Treatment of property RobotManipulation-PT-00001-LTLFireability-05 finished in 6317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 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 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 2 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-16 16:58:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 37 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 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 3 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 7 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 16:58:03] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 16:58:03] [INFO ] Invariant cache hit.
[2023-03-16 16:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-06 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:(AND (GEQ s0 1) (GEQ s2 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]]
Stuttering criterion allowed to conclude after 12 steps with 5 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-06 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 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 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 6 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-16 16:58:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 35 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/15 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 2 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 16:58:03] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 16:58:03] [INFO ] Invariant cache hit.
[2023-03-16 16:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-07 finished in 177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0||F(p1))&&(!p0||X(F(!p2)))))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_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 3 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 16:58:03] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 49 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 12 transition count 10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 10
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 10 transition count 9
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 10 transition count 9
Applied a total of 4 rules in 5 ms. Remains 10 /12 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:58:03] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 16:58:03] [INFO ] Invariant cache hit.
[2023-03-16 16:58:03] [INFO ] Implicit Places using invariants and state equation in 36 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 : 10/15 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 10/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p1)), (AND p0 p2)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s7 1)), p1:(AND (GEQ s0 1) (GEQ s4 1)), p2:(GEQ s5 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 36021 reset in 218 ms.
Stack based approach found an accepted trace after 854 steps with 323 reset with depth 16 and stack size 16 in 3 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-09 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 0 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 7 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-16 16:58:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants in 46 ms returned [4, 9, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 8/11 transitions.
Graph (trivial) has 5 edges and 8 vertex of which 3 / 8 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.
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 3 ms. Remains 5 /8 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 16:58:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 16:58:04] [INFO ] Invariant cache hit.
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 52 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[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], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-10 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(!p1)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 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 2 place count 13 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 4 place count 12 transition count 10
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 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2023-03-16 16:58:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants in 33 ms returned [9, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/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 8 transition count 9
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-03-16 16:58:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:58:04] [INFO ] Invariant cache hit.
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 8/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s7 1), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 289 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-13 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p1)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 5 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-16 16:58:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants in 33 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s4 1), p0:(OR (NOT (AND (GEQ s1 1) (GEQ s3 1))) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-14 finished in 160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)&&(G(!p2)||X(!p3)))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 16:58:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 16:58:04] [INFO ] Implicit Places using invariants in 27 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (AND p2 p3)), true, (OR (AND p1 p3) (AND p0 p3)), (NOT p1), (OR (AND p1 p2 p3) (AND p0 p2 p3)), p2]
Running random walk in product with property : RobotManipulation-PT-00001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 p2 p3) (AND p0 p2 p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 1}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s5 1)), p0:(LT s6 1), p2:(GEQ s10 1), p3:(OR (LT s2 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-LTLFireability-15 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(p1)) U p2)||X((p1||(p3&&G(p4))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p0 U p1)||G((p2 U p0))))))'
[2023-03-16 16:58:05] [INFO ] Flatten gal took : 9 ms
[2023-03-16 16:58:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 16:58:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 0 ms.
Total runtime 20822 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RobotManipulation-PT-00001
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

FORMULA RobotManipulation-PT-00001-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-00001-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678985886782

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 RobotManipulation-PT-00001-LTLFireability-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for RobotManipulation-PT-00001-LTLFireability-00
lola: result : true
lola: markings : 27
lola: fired transitions : 47
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 RobotManipulation-PT-00001-LTLFireability-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for RobotManipulation-PT-00001-LTLFireability-05
lola: result : true
lola: markings : 56
lola: fired transitions : 106
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RobotManipulation-PT-00001-LTLFireability-00: LTL true LTL model checker
RobotManipulation-PT-00001-LTLFireability-05: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-00001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is RobotManipulation-PT-00001, 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 r359-smll-167891808300004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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