Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281598800099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RobotManipulation-PT-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598800099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 8.0K Apr 29 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 29 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652947638115

Running Version 202205111006
[2022-05-19 08:07:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 08:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:07:19] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2022-05-19 08:07:19] [INFO ] Transformed 15 places.
[2022-05-19 08:07:19] [INFO ] Transformed 11 transitions.
[2022-05-19 08:07:19] [INFO ] Parsed PT model containing 15 places and 11 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-10000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 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 18 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 08:07:19] [INFO ] Computed 6 place invariants in 19 ms
[2022-05-19 08:07:19] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 08:07:19] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-19 08:07:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 08:07:19] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 08:07:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2022-05-19 08:07:20] [INFO ] Flatten gal took : 14 ms
[2022-05-19 08:07:20] [INFO ] Flatten gal took : 3 ms
[2022-05-19 08:07:20] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 20002 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=769 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 08:07:20] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 08:07:20] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 08:07:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-19 08:07:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 08:07:20] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-19 08:07:20] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-19 08:07:20] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 119792 steps, including 0 resets, run visited all 2 properties in 1089 ms. (steps per millisecond=110 )
Parikh walk visited 10 properties in 4613 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(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.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 08:07:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:07:25] [INFO ] Implicit Places using invariants in 519 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 521 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 6 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 08:07:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:26] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 08:07:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-19 08:07:26] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-00 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 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-10000-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-00 finished in 1143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 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 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 08:07:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 08:07:26] [INFO ] Implicit Places using invariants in 25 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 08:07:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:07:26] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 08:07:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:07:26] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-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:(LEQ s8 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 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-10000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-01 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 14 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-19 08:07:26] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 08:07:26] [INFO ] Implicit Places using invariants in 36 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 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 0 with 3 rules applied. Total rules applied 3 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 4 transition count 5
Applied a total of 5 rules in 2612 ms. Remains 4 /7 variables (removed 3) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-19 08:07:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 08:07:29] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-19 08:07:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 08:07:29] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 5/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-02 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 19561 reset in 133 ms.
Stack based approach found an accepted trace after 6 steps with 1 reset with depth 4 and stack size 4 in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-02 finished in 2909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(X((X(p1)&&G(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
[2022-05-19 08:07:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 08:07:29] [INFO ] Implicit Places using invariants in 27 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s6), p2:(LEQ s8 s4), p1:(LEQ s3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 60 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 p2 p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-10000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-03 finished in 494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 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 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-19 08:07:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants in 35 ms returned [3, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 4 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 5 ms. Remains 4 /6 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-19 08:07:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-19 08:07:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 5/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-04 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(F(((G(p0)||p1)&&p2))))&&p3)))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 08:07:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants in 36 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p2) p3)), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(LEQ s10 s9), p1:(LEQ 2 s3), p0:(LEQ s9 s1), p2:(LEQ s8 s0)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-05 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((F(p0)||X(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
[2022-05-19 08:07:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants in 55 ms returned [7, 8]
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/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
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 4 place count 5 transition count 5
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 08:07:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 08:07:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 61 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 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s3), p1:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 116 reset in 106 ms.
Stack based approach found an accepted trace after 811 steps with 2 reset with depth 3 and stack size 3 in 14 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-06 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p0)&&p1))&&X(F(p2)))))'
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 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
[2022-05-19 08:07:31] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants in 52 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 08:07:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 08:07:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s1 s7), p0:(LEQ s3 s6), p2:(LEQ s4 s2)], 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 0 reset in 75 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-08 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U p1)||G(!(p2 U p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 1 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-19 08:07:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants in 20 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/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 10 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 9 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 8 transition count 8
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-19 08:07:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-19 08:07:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 8/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 41 ms :[p1]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ s7 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-09 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(X(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.
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
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 12 place count 8 transition count 6
Applied a total of 12 rules in 2 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-19 08:07:31] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants in 25 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/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 6 transition count 5
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 5
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 08:07:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 08:07:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 130 ms :[p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s2), p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-11 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
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
[2022-05-19 08:07:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 08:07:32] [INFO ] Implicit Places using invariants in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 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 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s8 s12), p0:(OR (LEQ 1 s10) (LEQ 3 s6))], 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 54 ms.
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-10000-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-12 finished in 540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p1 U p2)||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 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
Applied a total of 6 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2022-05-19 08:07:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 08:07:32] [INFO ] Implicit Places using invariants in 43 ms returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 7
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:32] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 08:07:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/15 places, 7/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, p2, (AND (NOT p0) p2)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR p0 (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 2}]], initial=2, aps=[p2:(LEQ 1 s0), p1:(LEQ s6 s3), p0:(OR (LEQ 1 s0) (LEQ 2 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 88 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 p2) p1 p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (OR p0 (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 12 factoid took 595 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[true, p2, (AND (NOT p0) p2)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=4000 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 08:07:33] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-19 08:07:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 08:07:33] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 08:07:34] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-19 08:07:34] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 60001 steps, including 0 resets, run visited all 2 properties in 536 ms. (steps per millisecond=111 )
Parikh walk visited 2 properties in 536 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (OR p0 (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 (AND (NOT p1) (NOT p2))))), (G (NOT (AND p2 (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (OR (AND (NOT p1) (NOT p2)) p0))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 13 factoid took 772 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (AND p1 (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 65 ms :[true, (AND p1 (NOT p0) p2), p2]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:35] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 10 factoid took 568 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) p1 p2), p2]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=6667 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 08:07:36] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:07:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 08:07:36] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:07:36] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-19 08:07:36] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 100000 steps, including 0 resets, run visited all 2 properties in 712 ms. (steps per millisecond=140 )
Parikh walk visited 2 properties in 711 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), true, (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 637 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) p1 p2), p2]
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) p1 p2), p2]
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) p1 p2), p2]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Built C files in :
/tmp/ltsmin18302563658517847532
[2022-05-19 08:07:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18302563658517847532
Running compilation step : cd /tmp/ltsmin18302563658517847532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 162 ms.
Running link step : cd /tmp/ltsmin18302563658517847532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin18302563658517847532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12176450342363237869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 08:07:53] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 08:07:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:07:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin18327965239289402050
[2022-05-19 08:07:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18327965239289402050
Running compilation step : cd /tmp/ltsmin18327965239289402050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 52 ms.
Running link step : cd /tmp/ltsmin18327965239289402050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18327965239289402050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16749710056974581170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 08:08:08] [INFO ] Flatten gal took : 1 ms
[2022-05-19 08:08:08] [INFO ] Flatten gal took : 1 ms
[2022-05-19 08:08:08] [INFO ] Time to serialize gal into /tmp/LTL14833420672771624694.gal : 1 ms
[2022-05-19 08:08:08] [INFO ] Time to serialize properties into /tmp/LTL15979847060866550475.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14833420672771624694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15979847060866550475.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1483342...268
Read 1 LTL properties
Checking formula 0 : !((G(((!(("(initialized<=p_rdy)")U("(moved>=1)")))||("(moved>=1)"))||("(access>=2)"))))
Formula 0 simplified : !G("(access>=2)" | "(moved>=1)" | !("(initialized<=p_rdy)" U "(moved>=1)"))
Detected timeout of ITS tools.
[2022-05-19 08:08:23] [INFO ] Flatten gal took : 1 ms
[2022-05-19 08:08:23] [INFO ] Applying decomposition
[2022-05-19 08:08:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12923696840060474967.txt' '-o' '/tmp/graph12923696840060474967.bin' '-w' '/tmp/graph12923696840060474967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12923696840060474967.bin' '-l' '-1' '-v' '-w' '/tmp/graph12923696840060474967.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:08:23] [INFO ] Decomposing Gal with order
[2022-05-19 08:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:08:23] [INFO ] Flatten gal took : 23 ms
[2022-05-19 08:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-19 08:08:23] [INFO ] Time to serialize gal into /tmp/LTL11942991033954808712.gal : 0 ms
[2022-05-19 08:08:23] [INFO ] Time to serialize properties into /tmp/LTL10894933760315006127.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11942991033954808712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10894933760315006127.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1194299...268
Read 1 LTL properties
Checking formula 0 : !((G(((!(("(gu1.initialized<=gu1.p_rdy)")U("(gu0.moved>=1)")))||("(gu0.moved>=1)"))||("(gu0.access>=2)"))))
Formula 0 simplified : !G("(gu0.access>=2)" | "(gu0.moved>=1)" | !("(gu1.initialized<=gu1.p_rdy)" U "(gu0.moved>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16465374850696872934
[2022-05-19 08:08:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16465374850696872934
Running compilation step : cd /tmp/ltsmin16465374850696872934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin16465374850696872934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin16465374850696872934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((!((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-10000-LTLCardinality-15 finished in 81470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p1 U p2)||p0)))'
[2022-05-19 08:08:54] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11496331396158597969
[2022-05-19 08:08:54] [INFO ] Applying decomposition
[2022-05-19 08:08:54] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-19 08:08:54] [INFO ] Flatten gal took : 1 ms
[2022-05-19 08:08:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:08:54] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-19 08:08:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:08:54] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-19 08:08:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:08:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11496331396158597969
Running compilation step : cd /tmp/ltsmin11496331396158597969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4146041890837484154.txt' '-o' '/tmp/graph4146041890837484154.bin' '-w' '/tmp/graph4146041890837484154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4146041890837484154.bin' '-l' '-1' '-v' '-w' '/tmp/graph4146041890837484154.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:08:54] [INFO ] Decomposing Gal with order
[2022-05-19 08:08:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:08:54] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-19 08:08:54] [INFO ] Flatten gal took : 3 ms
[2022-05-19 08:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-19 08:08:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality15631930995516162584.gal : 1 ms
[2022-05-19 08:08:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality12875576388415221803.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15631930995516162584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12875576388415221803.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G(((!(("(gu2.initialized<=gu2.p_rdy)")U("(gi1.gu1.moved>=1)")))||("(gi1.gu1.moved>=1)"))||("(gi1.gu3.access>=2)"))))
Formula 0 simplified : !G("(gi1.gu1.moved>=1)" | "(gi1.gu3.access>=2)" | !("(gu2.initialized<=gu2.p_rdy)" U "(gi1.gu1.moved>=1)"))
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin11496331396158597969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin11496331396158597969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((!((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 2697 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 97658 ms.

BK_STOP 1652947736987

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-10000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-10000, 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 r204-oct2-165281598800099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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