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.r361-smll-167891810700035.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 ltsminxred
Input is RobotManipulation-PT-00020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891810700035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 05:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 05:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 05:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 05:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 05:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 05:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678978377164

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 14:53:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:53:00] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-16 14:53:00] [INFO ] Transformed 15 places.
[2023-03-16 14:53:00] [INFO ] Transformed 11 transitions.
[2023-03-16 14:53:00] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-00020-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00020-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00020-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 14 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 14:53:00] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 14:53:00] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-16 14:53:00] [INFO ] Invariant cache hit.
[2023-03-16 14:53:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-16 14:53:00] [INFO ] Invariant cache hit.
[2023-03-16 14:53:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 13 out of 15 places after structural reductions.
[2023-03-16 14:53:01] [INFO ] Flatten gal took : 24 ms
[2023-03-16 14:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:53:01] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 412 steps, including 0 resets, run visited all 25 properties in 18 ms. (steps per millisecond=22 )
FORMULA RobotManipulation-PT-00020-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RobotManipulation-PT-00020-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(p0)&&F(p1)) U p2)))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 14:53:01] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 14:53:01] [INFO ] Implicit Places using invariants in 44 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 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 49 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 408 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s4 s2), p1:(LEQ s8 s9), p0:(LEQ 1 s5)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 23 steps with 5 reset in 3 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-00 finished in 549 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))'
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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 12 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 14:53:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 14:53:02] [INFO ] Implicit Places using invariants in 42 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 7/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 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4 transition count 6
Applied a total of 4 rules in 2 ms. Remains 4 /6 variables (removed 2) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-16 14:53:02] [INFO ] Computed 1 place invariants in 11 ms
[2023-03-16 14:53:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 14:53:02] [INFO ] Invariant cache hit.
[2023-03-16 14:53:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 4/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7850 reset in 283 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 2 and stack size 2 in 0 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-01 finished in 452 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((F((!p0 U (p1||G(!p0)))) U X(p2)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 14:53:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 14:53:02] [INFO ] Implicit Places using invariants in 33 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 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 2 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 39 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-04 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GT s4 s5) (NOT (OR (LEQ s9 s4) (LEQ s4 s5)))), p2:(LEQ s9 s4), p0:(OR (LEQ s9 s4) (LEQ s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1114 reset in 252 ms.
Stack based approach found an accepted trace after 171 steps with 13 reset with depth 66 and stack size 66 in 1 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-04 finished in 602 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((G(p0) U 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 4 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 14:53:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 14:53:03] [INFO ] Implicit Places using invariants in 55 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 5 transition count 5
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 5 transition count 5
Applied a total of 5 rules in 5 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 14:53:03] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 14:53:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 14:53:03] [INFO ] Invariant cache hit.
[2023-03-16 14:53:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 75 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 140 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 2 s4) (LEQ 3 s2)), p0:(LEQ 2 s4)], 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 0 reset in 224 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-05 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
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 14:53:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 14:53:03] [INFO ] Implicit Places using invariants in 37 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3 s9), p1:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00020-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00020-LTLCardinality-06 finished in 520 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&&X(p1)&&G((p2||F(p3))))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 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 14:53:04] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-16 14:53:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 14:53:04] [INFO ] Invariant cache hit.
[2023-03-16 14:53:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-16 14:53:04] [INFO ] Invariant cache hit.
[2023-03-16 14:53:04] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s6), p2:(LEQ s13 s1), p3:(LEQ s5 s10), p1:(OR (LEQ 2 s3) (LEQ s5 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 162 ms.
Stack based approach found an accepted trace after 59 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-08 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&F(!p0)))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 5 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-16 14:53:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 14:53:05] [INFO ] Implicit Places using invariants in 42 ms returned [4, 9, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 8
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-16 14:53:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 14:53:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 14:53:05] [INFO ] Invariant cache hit.
[2023-03-16 14:53:05] [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 : 7/15 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 7/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) p0), true, (NOT p1), (NOT p1), p0]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s0 s5), p0:(LEQ s4 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 52 steps with 5 reset in 0 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-09 finished in 315 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||X(!p1)))||((!p0||X(!p1))&&F(p2)))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 14:53:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 14:53:05] [INFO ] Implicit Places using invariants in 36 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND p0 p1), (AND p0 p1), p1, (AND p0 (NOT p2) p1), true, (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 s5), p2:(GT s7 s12), p1:(AND (LEQ s8 s12) (LEQ 3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2104 reset in 101 ms.
Stack based approach found an accepted trace after 2177 steps with 59 reset with depth 131 and stack size 131 in 5 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-10 finished in 427 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)) U p0)&&F(G(p1))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 2 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 14:53:05] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 14:53:05] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32 ms. Remains : 9/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s4 s7), p1:(AND (LEQ s3 s8) (LEQ s4 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-11 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(!p1)))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 14:53:06] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 14:53:06] [INFO ] Implicit Places using invariants in 36 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 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 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 39 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 1 s5), p0:(GT 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00020-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00020-LTLCardinality-13 finished in 434 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)&&X(X(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 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
[2023-03-16 14:53:06] [INFO ] Invariant cache hit.
[2023-03-16 14:53:06] [INFO ] Implicit Places using invariants in 31 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), p0, p0, p0, true]
Running random walk in product with property : RobotManipulation-PT-00020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 3 reset in 1 ms.
FORMULA RobotManipulation-PT-00020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00020-LTLCardinality-14 finished in 262 ms.
All properties solved by simple procedures.
Total runtime 6691 ms.
ITS solved all properties within timeout

BK_STOP 1678978387807

--------------------
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

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-00020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RobotManipulation-PT-00020, 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 r361-smll-167891810700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00020.tgz
mv RobotManipulation-PT-00020 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;