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-165281598800091.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-05000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598800091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.8K Apr 29 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:31 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 4.0K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.4K 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-05000-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652947600878

Running Version 202205111006
[2022-05-19 08:06:41] [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:06:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:06:42] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2022-05-19 08:06:42] [INFO ] Transformed 15 places.
[2022-05-19 08:06:42] [INFO ] Transformed 11 transitions.
[2022-05-19 08:06:42] [INFO ] Parsed PT model containing 15 places and 11 transitions in 125 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 2 formulas.
FORMULA RobotManipulation-PT-05000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-05000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 8 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:06:42] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-19 08:06:42] [INFO ] Implicit Places using invariants in 88 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 14/15 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2022-05-19 08:06:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 08:06:42] [INFO ] Flatten gal took : 15 ms
FORMULA RobotManipulation-PT-05000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:06:42] [INFO ] Flatten gal took : 5 ms
[2022-05-19 08:06:42] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 08:06:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 08:06:42] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 08:06:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 08:06:42] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-05-19 08:06:42] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 08:06:42] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 08:06:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 08:06:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 08:06:42] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-19 08:06:42] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-19 08:06:42] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 79886 steps, including 1 resets, run visited all 3 properties in 441 ms. (steps per millisecond=181 )
Parikh walk visited 7 properties in 1854 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA RobotManipulation-PT-05000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X((G(p0)&&G(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 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 11
Applied a total of 2 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:06:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:06:45] [INFO ] Implicit Places using invariants in 21 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 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 7 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:06:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 08:06:45] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 08:06:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:06:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/14 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s5), p1:(GT 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-00 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 8 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 7 transition count 6
Applied a total of 12 rules in 723 ms. Remains 7 /14 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 08:06:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:06:46] [INFO ] Implicit Places using invariants in 27 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/14 places, 6/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 s2) (LEQ s5 s4))], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-02 finished in 798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 12 transition count 7
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 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 10 place count 8 transition count 6
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 12 place count 7 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 15 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 4 transition count 4
Applied a total of 17 rules in 688 ms. Remains 4 /14 variables (removed 10) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-19 08:06:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:06:46] [INFO ] Implicit Places using invariants in 16 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/14 places, 4/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-03 finished in 768 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
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 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 08:06:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:06:46] [INFO ] Implicit Places using invariants in 16 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 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 2 iterations. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT 1 s4), p1:(OR (GT s3 s11) (GT s4 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 144 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 (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 208 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59996 steps, run visited all 1 properties in 97 ms. (steps per millisecond=618 )
Probabilistic random walk after 59996 steps, saw 46664 distinct states, run finished after 97 ms. (steps per millisecond=618 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:06:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:06:48] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:06:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:06:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:06:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:06:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59996 steps, run visited all 1 properties in 60 ms. (steps per millisecond=999 )
Probabilistic random walk after 59996 steps, saw 46664 distinct states, run finished after 60 ms. (steps per millisecond=999 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Graph (trivial) has 6 edges and 12 vertex of which 6 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 3 ms. Remains 7 /12 variables (removed 5) and now considering 6/11 (removed 5) transitions.
[2022-05-19 08:06:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 08:06:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:06:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/12 places, 6/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/12 places, 6/11 transitions.
Product exploration explored 100000 steps with 0 reset in 326 ms.
Product exploration explored 100000 steps with 0 reset in 246 ms.
Built C files in :
/tmp/ltsmin12915349212310617415
[2022-05-19 08:06:49] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12915349212310617415
Running compilation step : cd /tmp/ltsmin12915349212310617415;'/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 372 ms.
Running link step : cd /tmp/ltsmin12915349212310617415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12915349212310617415;'/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/stateBased8080364942437408521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:07:04] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-19 08:07:05] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:07:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:07:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:07:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:07:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin273246731037914573
[2022-05-19 08:07:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin273246731037914573
Running compilation step : cd /tmp/ltsmin273246731037914573;'/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 58 ms.
Running link step : cd /tmp/ltsmin273246731037914573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin273246731037914573;'/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/stateBased6764836306833607485.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 08:07:20] [INFO ] Flatten gal took : 1 ms
[2022-05-19 08:07:20] [INFO ] Flatten gal took : 1 ms
[2022-05-19 08:07:20] [INFO ] Time to serialize gal into /tmp/LTL10396640756773854709.gal : 10 ms
[2022-05-19 08:07:20] [INFO ] Time to serialize properties into /tmp/LTL7149405130770693544.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/LTL10396640756773854709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7149405130770693544.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/LTL1039664...267
Read 1 LTL properties
Checking formula 0 : !(((X("(r_stopped<1)"))||(G("((off>p_i2)||(r_stopped>initialize))"))))
Formula 0 simplified : !(X"(r_stopped<1)" | G"((off>p_i2)||(r_stopped>initialize))")
Detected timeout of ITS tools.
[2022-05-19 08:07:35] [INFO ] Flatten gal took : 3 ms
[2022-05-19 08:07:35] [INFO ] Applying decomposition
[2022-05-19 08:07:35] [INFO ] Flatten gal took : 7 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/graph9546386044088532808.txt' '-o' '/tmp/graph9546386044088532808.bin' '-w' '/tmp/graph9546386044088532808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9546386044088532808.bin' '-l' '-1' '-v' '-w' '/tmp/graph9546386044088532808.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:07:35] [INFO ] Decomposing Gal with order
[2022-05-19 08:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:07:35] [INFO ] Flatten gal took : 28 ms
[2022-05-19 08:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-19 08:07:35] [INFO ] Time to serialize gal into /tmp/LTL8164646743318824685.gal : 1 ms
[2022-05-19 08:07:35] [INFO ] Time to serialize properties into /tmp/LTL13335672800155625106.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/LTL8164646743318824685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13335672800155625106.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/LTL8164646...267
Read 1 LTL properties
Checking formula 0 : !(((X("(gu0.r_stopped<1)"))||(G("((gu4.off>gu4.p_i2)||(gu0.r_stopped>gu0.initialize))"))))
Formula 0 simplified : !(X"(gu0.r_stopped<1)" | G"((gu4.off>gu4.p_i2)||(gu0.r_stopped>gu0.initialize))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16121912664740567108
[2022-05-19 08:07:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16121912664740567108
Running compilation step : cd /tmp/ltsmin16121912664740567108;'/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 50 ms.
Running link step : cd /tmp/ltsmin16121912664740567108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin16121912664740567108;'/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' '(X((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-05000-LTLCardinality-04 finished in 78654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 12 transition count 8
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 8 transition count 6
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 7 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 4 transition count 4
Applied a total of 17 rules in 833 ms. Remains 4 /14 variables (removed 10) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-19 08:08:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:08:06] [INFO ] Implicit Places using invariants in 20 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/14 places, 4/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-05 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 3 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 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-05 finished in 901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(G(p0)))))))'
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 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 12 transition count 6
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 5 transition count 4
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 17 place count 4 transition count 4
Applied a total of 17 rules in 2 ms. Remains 4 /14 variables (removed 10) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-19 08:08:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 08:08:06] [INFO ] Implicit Places using invariants in 18 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/14 places, 4/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GT s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-06 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U p1)||F(p2)))&&(X(p3)||X(G(p4)))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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
[2022-05-19 08:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:08:06] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 08:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:08:07] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 08:08:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 08:08:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p1)), (AND (NOT p4) (NOT p3)), true, (NOT p4)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p4), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 3}, { cond=p4, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 s10), p1:(LEQ s5 s8), p3:(GT 1 s3), p4:(GT 3 s12)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 188 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 p2 p1 p3 p4), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p4))), true, (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) p4)))
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 5 states, 8 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-05000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLCardinality-08 finished in 1241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((G(p0)||p1))||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 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 08:08:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:08:07] [INFO ] Implicit Places using invariants in 18 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/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 2 iterations. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT s10 s4), p1:(LEQ s11 s8), p0:(LEQ s0 s10)], 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 3064 reset in 80 ms.
Product exploration explored 100000 steps with 3166 reset in 92 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 p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:08:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:08:08] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:08:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 08:08:08] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:08:08] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:08:08] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 08:08:08] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19761 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=790 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:08:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:08:09] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:08:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:08:09] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:08:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:08:09] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:08:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:08:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:08:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 08:08:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 08:08:09] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:08:09] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 08:08:09] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19679 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=1311 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2634 reset in 76 ms.
Product exploration explored 100000 steps with 3005 reset in 88 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 10/11 (removed 1) transitions.
[2022-05-19 08:08:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 08:08:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:08:10] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 10/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 10/11 transitions.
Product exploration explored 100000 steps with 2876 reset in 102 ms.
Product exploration explored 100000 steps with 2736 reset in 253 ms.
Built C files in :
/tmp/ltsmin1550875419131961003
[2022-05-19 08:08:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1550875419131961003
Running compilation step : cd /tmp/ltsmin1550875419131961003;'/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 60 ms.
Running link step : cd /tmp/ltsmin1550875419131961003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin1550875419131961003;'/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/stateBased5912951818109023848.hoa' '--buchi-type=spotba'
LTSmin run took 750 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-05000-LTLCardinality-09 finished in 3757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(G(X(p0)))))) U 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 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 08:08:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:08:11] [INFO ] Implicit Places using invariants in 21 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 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 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s2 s5), p0:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 45 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)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 7 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-05000-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLCardinality-11 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(G(p0))))&&F(X(G(p1))))))'
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.
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 12 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 11 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 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 9 transition count 8
Applied a total of 8 rules in 4 ms. Remains 9 /14 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-19 08:08:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 08:08:12] [INFO ] Implicit Places using invariants in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/14 places, 8/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/14 places, 8/11 transitions.
Stuttering acceptance computed with spot in 30 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s7 s1) (LEQ s6 s4)), p1:(LEQ s7 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-12 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((!G(p0) U p1) U p1))'
Support contains 3 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 10 transition count 7
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 9 place count 9 transition count 7
Applied a total of 9 rules in 3 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-19 08:08:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 08:08:12] [INFO ] Implicit Places using invariants in 19 ms returned [7, 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 : 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 608 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-19 08:08:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:08:12] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-19 08:08:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 08:08:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 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 2 iterations. Remains : 6/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s2), p0:(LEQ s5 s0)], 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, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-14 finished in 819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1)||F(F(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 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 11
Applied a total of 2 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2022-05-19 08:08:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 08:08:13] [INFO ] Implicit Places using invariants in 19 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 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 2 iterations. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s4 s8), p1:(GT 2 s3)], nbAcceptance=0, 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 33333 reset in 66 ms.
Product exploration explored 100000 steps with 33333 reset in 73 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 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-05000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLCardinality-15 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
[2022-05-19 08:08:13] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2022-05-19 08:08:13] [INFO ] Applying decomposition
[2022-05-19 08:08:13] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin991695243267214555
[2022-05-19 08:08:13] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-19 08:08:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:08:13] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-19 08:08:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:08:13] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-19 08:08:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:08:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin991695243267214555
Running compilation step : cd /tmp/ltsmin991695243267214555;'/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/graph8167056848436237637.txt' '-o' '/tmp/graph8167056848436237637.bin' '-w' '/tmp/graph8167056848436237637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8167056848436237637.bin' '-l' '-1' '-v' '-w' '/tmp/graph8167056848436237637.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:08:13] [INFO ] Decomposing Gal with order
[2022-05-19 08:08:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:08:13] [INFO ] Flatten gal took : 2 ms
[2022-05-19 08:08:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-19 08:08:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality18410346068693242529.gal : 2 ms
[2022-05-19 08:08:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality10297214452554876211.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/LTLCardinality18410346068693242529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10297214452554876211.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 : !(((X("(gu1.r_stopped<1)"))||(G("((gu0.off>gu0.p_i2)||(gu1.r_stopped>gu1.initialize))"))))
Formula 0 simplified : !(X"(gu1.r_stopped<1)" | G"((gu0.off>gu0.p_i2)||(gu1.r_stopped>gu1.initialize))")
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin991695243267214555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin991695243267214555;'/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' '(X((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: LTL layer: formula: (X((LTLAPp0==true))||[]((LTLAPp1==true)))
pins2lts-mc-linux64( 0/ 8), 0.001: "(X((LTLAPp0==true))||[]((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.008: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.060: DFS-FIFO for weak LTL, using special progress label 14
pins2lts-mc-linux64( 0/ 8), 0.060: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 15, there are 19 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.083: ~1 levels ~960 states ~3280 transitions
pins2lts-mc-linux64( 5/ 8), 0.088: ~1 levels ~1920 states ~7400 transitions
pins2lts-mc-linux64( 5/ 8), 0.110: ~1 levels ~3840 states ~15832 transitions
pins2lts-mc-linux64( 5/ 8), 0.137: ~1 levels ~7680 states ~33016 transitions
pins2lts-mc-linux64( 3/ 8), 0.211: ~1 levels ~15360 states ~84736 transitions
pins2lts-mc-linux64( 0/ 8), 0.297: ~1 levels ~30720 states ~181312 transitions
pins2lts-mc-linux64( 0/ 8), 0.484: ~1 levels ~61440 states ~377224 transitions
pins2lts-mc-linux64( 3/ 8), 0.765: ~1 levels ~122880 states ~790472 transitions
pins2lts-mc-linux64( 3/ 8), 1.166: ~1 levels ~245760 states ~1631776 transitions
pins2lts-mc-linux64( 3/ 8), 1.747: ~1 levels ~491520 states ~3379288 transitions
pins2lts-mc-linux64( 3/ 8), 2.511: ~1 levels ~983040 states ~6911696 transitions
pins2lts-mc-linux64( 3/ 8), 3.699: ~1 levels ~1966080 states ~14192552 transitions
pins2lts-mc-linux64( 5/ 8), 6.176: ~1 levels ~3932160 states ~26269504 transitions
pins2lts-mc-linux64( 5/ 8), 10.916: ~1 levels ~7864320 states ~53703048 transitions
pins2lts-mc-linux64( 5/ 8), 22.177: ~1 levels ~15728640 states ~111784144 transitions
pins2lts-mc-linux64( 5/ 8), 43.943: ~1 levels ~31457280 states ~229469184 transitions
pins2lts-mc-linux64( 5/ 8), 95.429: ~1 levels ~62914560 states ~473358200 transitions
pins2lts-mc-linux64( 6/ 8), 103.385: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 103.415:
pins2lts-mc-linux64( 0/ 8), 103.415: mean standard work distribution: 3.4% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 103.415:
pins2lts-mc-linux64( 0/ 8), 103.415: Explored 61887667 states 507416528 transitions, fanout: 8.199
pins2lts-mc-linux64( 0/ 8), 103.415: Total exploration time 103.340 sec (103.310 sec minimum, 103.328 sec on average)
pins2lts-mc-linux64( 0/ 8), 103.415: States per second: 598874, Transitions per second: 4910166
pins2lts-mc-linux64( 0/ 8), 103.415:
pins2lts-mc-linux64( 0/ 8), 103.415: Progress states detected: 67896880
pins2lts-mc-linux64( 0/ 8), 103.415: Redundant explorations: -8.8507
pins2lts-mc-linux64( 0/ 8), 103.415:
pins2lts-mc-linux64( 0/ 8), 103.415: Queue width: 8B, total height: 12644117, memory: 96.47MB
pins2lts-mc-linux64( 0/ 8), 103.415: Tree memory: 774.0MB, 12.0 B/state, compr.: 19.3%
pins2lts-mc-linux64( 0/ 8), 103.415: Tree fill ratio (roots/leafs): 50.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 103.415: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 103.415: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 103.415: Est. total memory use: 870.5MB (~1120.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin991695243267214555;'/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' '(X((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin991695243267214555;'/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' '(X((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 08:28:46] [INFO ] Flatten gal took : 176 ms
[2022-05-19 08:28:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality17442210115331161611.gal : 29 ms
[2022-05-19 08:28:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality688331973169289580.ltl : 3 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/LTLCardinality17442210115331161611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality688331973169289580.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...288
Read 1 LTL properties
Checking formula 0 : !(((X("(r_stopped<1)"))||(G("((off>p_i2)||(r_stopped>initialize))"))))
Formula 0 simplified : !(X"(r_stopped<1)" | G"((off>p_i2)||(r_stopped>initialize))")
Detected timeout of ITS tools.
[2022-05-19 08:49:17] [INFO ] Flatten gal took : 126 ms
[2022-05-19 08:49:17] [INFO ] Input system was already deterministic with 11 transitions.
[2022-05-19 08:49:17] [INFO ] Transformed 14 places.
[2022-05-19 08:49:17] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 08:49:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality538417702002884997.gal : 3 ms
[2022-05-19 08:49:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality9670844707158941347.ltl : 3 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/LTLCardinality538417702002884997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9670844707158941347.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...332
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X("(r_stopped<1)"))||(G("((off>p_i2)||(r_stopped>initialize))"))))
Formula 0 simplified : !(X"(r_stopped<1)" | G"((off>p_i2)||(r_stopped>initialize))")

BK_TIME_CONFINEMENT_REACHED

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

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