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-167891808400051.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-00100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808400051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Feb 26 05:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 05:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 05:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 05:32 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 29K 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 17K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 05:33 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-00100-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678987375752

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-00100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 17:22:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 17:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:22:59] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-16 17:22:59] [INFO ] Transformed 15 places.
[2023-03-16 17:22:59] [INFO ] Transformed 11 transitions.
[2023-03-16 17:22:59] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-00100-LTLCardinality-03 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.
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 19 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 17:22:59] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-16 17:22:59] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-16 17:22:59] [INFO ] Invariant cache hit.
[2023-03-16 17:23:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-16 17:23:00] [INFO ] Invariant cache hit.
[2023-03-16 17:23:00] [INFO ] Dead Transitions using invariants and state equation in 55 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 403 ms. Remains : 14/15 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-16 17:23:00] [INFO ] Flatten gal took : 29 ms
[2023-03-16 17:23:00] [INFO ] Flatten gal took : 8 ms
[2023-03-16 17:23:00] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10072 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=186 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 17:23:00] [INFO ] Invariant cache hit.
[2023-03-16 17:23:00] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:23:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-16 17:23:00] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RobotManipulation-PT-00100-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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(F(p0)))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 17:23:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 17:23:01] [INFO ] Implicit Places using invariants in 44 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 5 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 17:23:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 17:23:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 17:23:01] [INFO ] Invariant cache hit.
[2023-03-16 17:23:01] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/14 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s10 s5) (LEQ 1 s3) (LEQ 1 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6399 reset in 474 ms.
Stack based approach found an accepted trace after 1533 steps with 88 reset with depth 14 and stack size 14 in 21 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-01 finished in 1068 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(F(p0))||(F(p0)&&F(!p0)))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 17:23:02] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 17:23:02] [INFO ] Implicit Places using invariants in 46 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 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 850 reset in 275 ms.
Stack based approach found an accepted trace after 18 steps with 1 reset with depth 11 and stack size 11 in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-02 finished in 460 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) U (p1||X((p2||(p1 U p3)))))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2023-03-16 17:23:02] [INFO ] Invariant cache hit.
[2023-03-16 17:23:03] [INFO ] Implicit Places using invariants in 57 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 589 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 2 s9), p0:(LEQ 3 s9), p2:(LEQ s3 s8), p3:(LEQ s0 s9)], 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 9 factoid took 336 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00100-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLCardinality-04 finished in 1291 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((F(p1)||p0))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/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 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 3 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 4 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 4 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 6 place count 11 transition count 8
Applied a total of 6 rules in 19 ms. Remains 11 /14 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-16 17:23:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 17:23:04] [INFO ] Implicit Places using invariants in 53 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/14 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 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 6 transition count 6
Applied a total of 5 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 17:23:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 17:23:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 17:23:04] [INFO ] Invariant cache hit.
[2023-03-16 17:23:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/14 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 6/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s3 s4) (GT s5 s1)), p1:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3 reset in 144 ms.
Stack based approach found an accepted trace after 27191 steps with 0 reset with depth 27192 and stack size 23960 in 31 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-05 finished in 421 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&&F(p1)))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 17:23:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 17:23:04] [INFO ] Implicit Places using invariants in 31 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 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/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s10), p1:(OR (LEQ 2 s9) (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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-06 finished in 233 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((F(p1)&&p0))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2023-03-16 17:23:04] [INFO ] Invariant cache hit.
[2023-03-16 17:23:04] [INFO ] Implicit Places using invariants in 36 ms returned [10]
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 : 12/14 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 17:23:04] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 17:23:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 17:23:04] [INFO ] Invariant cache hit.
[2023-03-16 17:23:05] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/14 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT s3 s2) (LEQ 3 s5)), p1:(LEQ 3 s5)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-07 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&X(p2))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 3 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 17:23:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 17:23:05] [INFO ] Implicit Places using invariants in 50 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 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 56 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s0 s8), p0:(OR (LEQ 3 s6) (LEQ s0 s8)), p2:(GT 2 s5)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2)
Knowledge based reduction with 14 factoid took 1020 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00100-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLCardinality-09 finished in 1954 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 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 2 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 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 9 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 17:23:07] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-16 17:23:07] [INFO ] Implicit Places using invariants in 54 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 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 2 place count 6 transition count 6
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 17:23:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 17:23:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-16 17:23:07] [INFO ] Invariant cache hit.
[2023-03-16 17:23:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/14 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 6/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1 s5), p1:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-10 finished in 474 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&&X((p0 U (p1||G(p0)))))) U !p1)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 17:23:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 17:23:07] [INFO ] Implicit Places using invariants in 43 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 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 45 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 189 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s8 s3), p0:(GT 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 62 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 p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 10 factoid took 242 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLCardinality-11 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||F(G(p2)))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2023-03-16 17:23:08] [INFO ] Invariant cache hit.
[2023-03-16 17:23:08] [INFO ] Implicit Places using invariants in 34 ms returned [10]
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/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ s3 s0), p0:(AND (LEQ 3 s5) (LEQ s11 s9)), p2:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 104 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) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) (NOT p2))
Knowledge based reduction with 8 factoid took 343 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00100-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLCardinality-12 finished in 776 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(F(p1))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2023-03-16 17:23:09] [INFO ] Invariant cache hit.
[2023-03-16 17:23:09] [INFO ] Implicit Places using invariants in 54 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s10 s7), p1:(LEQ s7 s8)], 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 93 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 157 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-00100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLCardinality-13 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&(X(p1)||!(p0 U p2))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 17:23:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 17:23:09] [INFO ] Implicit Places using invariants in 46 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/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p2 p0 (NOT p1)), true, p2]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s7 s2), p0:(LEQ s2 s11), p1:(GT s5 s7)], 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 1 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-14 finished in 397 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||X(X(p1))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 17:23:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 17:23:10] [INFO ] Implicit Places using invariants in 50 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(GT s8 s3), p1:(GT s6 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1230 reset in 147 ms.
Stack based approach found an accepted trace after 396 steps with 5 reset with depth 87 and stack size 79 in 8 ms.
FORMULA RobotManipulation-PT-00100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLCardinality-15 finished in 394 ms.
All properties solved by simple procedures.
Total runtime 11399 ms.
ITS solved all properties within timeout

BK_STOP 1678987391551

--------------------
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-00100"
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-00100, 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-167891808400051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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