About the Execution of LoLa+red for RobotManipulation-PT-02000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 926.556 | 43223.00 | 59757.00 | 703.50 | TTTFTTTFF?FFFFFF | normal |
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-167891808400083.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-02000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808400083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 05:35 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 3.5K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 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-02000-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678996164997
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-02000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 19:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 19:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:49:28] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-16 19:49:28] [INFO ] Transformed 15 places.
[2023-03-16 19:49:28] [INFO ] Transformed 11 transitions.
[2023-03-16 19:49:28] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA RobotManipulation-PT-02000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-13 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 19:49:28] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 19:49:29] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-16 19:49:29] [INFO ] Invariant cache hit.
[2023-03-16 19:49:29] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-16 19:49:29] [INFO ] Invariant cache hit.
[2023-03-16 19:49:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 14 out of 15 places after structural reductions.
[2023-03-16 19:49:29] [INFO ] Flatten gal took : 28 ms
[2023-03-16 19:49:29] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:49:29] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=300 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-16 19:49:30] [INFO ] Invariant cache hit.
[2023-03-16 19:49:30] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 19:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 19:49:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:49:30] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-16 19:49:30] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-16 19:49:30] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23868 steps, including 0 resets, run visited all 2 properties in 241 ms. (steps per millisecond=99 )
Parikh walk visited 2 properties in 242 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA RobotManipulation-PT-02000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X(F(p0))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 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 19:49:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:49:31] [INFO ] Implicit Places using invariants in 52 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 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 59 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LEQ s5 s11) (LEQ s2 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 453 ms.
Product exploration explored 100000 steps with 33333 reset in 269 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-02000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-02000-LTLCardinality-04 finished in 1323 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 1 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
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 14 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 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 9 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-16 19:49:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants in 30 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 7/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 5 transition count 5
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 0 with 2 rules applied. Total rules applied 6 place count 4 transition count 4
Applied a total of 6 rules in 5 ms. Remains 4 /8 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-16 19:49:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 19:49:32] [INFO ] Invariant cache hit.
[2023-03-16 19:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-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:(LEQ 1 s3)], 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 9 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-07 finished in 138 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(G(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 19:49:32] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants in 33 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-16 19:49:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 19:49:32] [INFO ] Invariant cache hit.
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 s6)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-08 finished in 191 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(X(X(X((G(p0) U X(G(p1))))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 19:49:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 19:49:32] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 1 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 32 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 478 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 3 s9), p0:(GT s12 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 0 reset in 300 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2001 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 19:49:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 19:49:34] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 19:49:34] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:49:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 19:49:34] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 19:49:34] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 19:49:34] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 19844 steps, including 0 resets, run visited all 1 properties in 54 ms. (steps per millisecond=367 )
Parikh walk visited 3 properties in 606 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 457 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Support contains 3 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 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-16 19:49:36] [INFO ] Invariant cache hit.
[2023-03-16 19:49:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-16 19:49:36] [INFO ] Invariant cache hit.
[2023-03-16 19:49:36] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-16 19:49:36] [INFO ] Invariant cache hit.
[2023-03-16 19:49:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 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 p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:49:37] [INFO ] Invariant cache hit.
[2023-03-16 19:49:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 19:49:37] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:49:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 19:49:37] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 19:49:37] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 19:49:37] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 19984 steps, including 0 resets, run visited all 1 properties in 32 ms. (steps per millisecond=624 )
Parikh walk visited 3 properties in 713 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 2 factoid took 359 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 628 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 440 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 410 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 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 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 13 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 13 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 11 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 8 ms. Remains 11 /13 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2023-03-16 19:49:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2023-03-16 19:49:41] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-16 19:49:41] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/13 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 11/13 places, 9/11 transitions.
Support contains 3 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 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 19:49:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 19:49:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 19:49:41] [INFO ] Invariant cache hit.
[2023-03-16 19:49:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-16 19:49:41] [INFO ] Invariant cache hit.
[2023-03-16 19:49:42] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 13/13 places, 11/11 transitions.
Treatment of property RobotManipulation-PT-02000-LTLCardinality-09 finished in 9416 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)||G((F(p1) U 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 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 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 6 place count 11 transition count 9
Applied a total of 6 rules in 5 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 19:49:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:49:42] [INFO ] Implicit Places using invariants in 40 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-16 19:49:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:49:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 19:49:42] [INFO ] Invariant cache hit.
[2023-03-16 19:49:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 8/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s1 s0), p1:(OR (GT s2 s6) (LEQ s7 s0)), p0:(GT s2 s6)], nbAcceptance=2, 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 191 reset in 182 ms.
Stack based approach found an accepted trace after 20452 steps with 29 reset with depth 1408 and stack size 1381 in 70 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-10 finished in 584 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&&G(F(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 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
Applied a total of 3 rules in 3 ms. Remains 13 /15 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-16 19:49:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 19:49:42] [INFO ] Implicit Places using invariants in 39 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/15 places, 10/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 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 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 0 with 2 rules applied. Total rules applied 5 place count 8 transition count 8
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 7 place count 7 transition count 8
Applied a total of 7 rules in 4 ms. Remains 7 /11 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-16 19:49:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:49:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 19:49:42] [INFO ] Invariant cache hit.
[2023-03-16 19:49:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/15 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 7/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 s6), p0:(GT s1 s0)], 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 4687 reset in 220 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-12 finished in 569 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 (p1 U X(p1))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 19:49:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:49:43] [INFO ] Implicit Places using invariants in 47 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 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 52 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s6), p0:(GT 2 s11)], 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 3 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-14 finished in 282 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)&&F(G(!p1)))))'
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 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 3 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 6 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 19:49:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:49:43] [INFO ] Implicit Places using invariants in 41 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 6 transition count 6
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 6 transition count 6
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 6 place count 5 transition count 5
Applied a total of 6 rules in 4 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 19:49:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 19:49:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 19:49:43] [INFO ] Invariant cache hit.
[2023-03-16 19:49:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 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 118 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s0), p1:(LEQ 3 s3)], 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 1 reset in 131 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 22 in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-15 finished in 408 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(X(X(X((G(p0) U X(G(p1))))))))'
Found a Lengthening insensitive property : RobotManipulation-PT-02000-LTLCardinality-09
Stuttering acceptance computed with spot in 457 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 8 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 19:49:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 19:49:44] [INFO ] Implicit Places using invariants in 47 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/15 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 7 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 6 transition count 5
Applied a total of 7 rules in 6 ms. Remains 6 /10 variables (removed 4) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-16 19:49:44] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 19:49:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 19:49:44] [INFO ] Invariant cache hit.
[2023-03-16 19:49:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/15 places, 5/11 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 126 ms. Remains : 6/15 places, 5/11 transitions.
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 3 s3), p0:(GT s5 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], 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 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:49:45] [INFO ] Invariant cache hit.
[2023-03-16 19:49:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 19:49:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:49:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:49:46] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 19:49:46] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-16 19:49:46] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 12000 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=750 )
Parikh walk visited 3 properties in 282 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 2 factoid took 337 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 445 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-16 19:49:47] [INFO ] Invariant cache hit.
[2023-03-16 19:49:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 19:49:47] [INFO ] Invariant cache hit.
[2023-03-16 19:49:47] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-16 19:49:47] [INFO ] Invariant cache hit.
[2023-03-16 19:49:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 6/6 places, 5/5 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 p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3002 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:49:48] [INFO ] Invariant cache hit.
[2023-03-16 19:49:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:49:48] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:49:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:49:48] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 19:49:48] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 19:49:48] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 12000 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=705 )
Parikh walk visited 3 properties in 332 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 2 factoid took 418 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 433 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 451 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 450 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-16 19:49:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 19:49:51] [INFO ] Invariant cache hit.
[2023-03-16 19:49:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 6/6 places, 5/5 transitions.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-16 19:49:51] [INFO ] Invariant cache hit.
[2023-03-16 19:49:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 19:49:51] [INFO ] Invariant cache hit.
[2023-03-16 19:49:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-16 19:49:51] [INFO ] Invariant cache hit.
[2023-03-16 19:49:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property RobotManipulation-PT-02000-LTLCardinality-09 finished in 7904 ms.
[2023-03-16 19:49:51] [INFO ] Flatten gal took : 5 ms
[2023-03-16 19:49:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-16 19:49:51] [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 23485 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RobotManipulation-PT-02000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality
BK_STOP 1678996208220
--------------------
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 LTLCardinality -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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:379
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-02000-LTLCardinality-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RobotManipulation-PT-02000-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 16/32 RobotManipulation-PT-02000-LTLCardinality-09 2325777 m, 465155 m/sec, 5346131 t fired, .
Time elapsed: 5 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RobotManipulation-PT-02000-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 29/32 RobotManipulation-PT-02000-LTLCardinality-09 4279079 m, 390660 m/sec, 10340227 t fired, .
Time elapsed: 10 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for RobotManipulation-PT-02000-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RobotManipulation-PT-02000-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RobotManipulation-PT-02000-LTLCardinality-09: LTL unknown AGGR
Time elapsed: 15 secs. Pages in use: 32
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="LTLCardinality"
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-02000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891808400083"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;