fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r361-smll-167891810900100
Last Updated
May 14, 2023

About the Execution of LTSMin+red for RobotManipulation-PT-10000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
699.132 16349.00 25542.00 364.20 FFFF?FFTTFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r361-smll-167891810900100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RobotManipulation-PT-10000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891810900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.9K Feb 26 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 05:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 05:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 05:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679042208520

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-10000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 08:36:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 08:36:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:36:51] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-17 08:36:51] [INFO ] Transformed 15 places.
[2023-03-17 08:36:51] [INFO ] Transformed 11 transitions.
[2023-03-17 08:36:51] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-10000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-LTLFireability-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 13 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-17 08:36:51] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-17 08:36:51] [INFO ] Implicit Places using invariants in 144 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 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 LTL mode , in 2 iterations and 211 ms. Remains : 14/15 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-17 08:36:51] [INFO ] Flatten gal took : 20 ms
[2023-03-17 08:36:51] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:36:51] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 20002 steps, including 0 resets, run finished after 109 ms. (steps per millisecond=183 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 14 cols
[2023-03-17 08:36:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-17 08:36:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-17 08:36:52] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 08:36:52] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 08:36:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-17 08:36:52] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 08:36:52] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 08:36:52] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-17 08:36:52] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 98695 steps, including 0 resets, run visited all 2 properties in 917 ms. (steps per millisecond=107 )
Parikh walk visited 2 properties in 918 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 11 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 4 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-17 08:36:53] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 08:36:53] [INFO ] Implicit Places using invariants in 30 ms returned [5]
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 : 10/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-01 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(G(p1))&&G(!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 2 places :
Implicit places reduction removed 2 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 4 rules applied. Total rules applied 4 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 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 2 with 2 rules applied. Total rules applied 8 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 10 place count 8 transition count 8
Applied a total of 10 rules in 13 ms. Remains 8 /14 variables (removed 6) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 08:36:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 08:36:54] [INFO ] Implicit Places using invariants in 29 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 8/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 7
Deduced a syphon composed of 1 places in 1 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 7
Applied a total of 2 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-17 08:36:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 08:36:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 08:36:54] [INFO ] Invariant cache hit.
[2023-03-17 08:36:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/14 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 6/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-02 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 11 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-17 08:36:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 08:36:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 08:36:54] [INFO ] Invariant cache hit.
[2023-03-17 08:36:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-17 08:36:54] [INFO ] Invariant cache hit.
[2023-03-17 08:36:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-03 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 10 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 8 transition count 7
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 7 transition count 6
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 7 transition count 6
Applied a total of 12 rules in 6 ms. Remains 7 /14 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-17 08:36:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 08:36:54] [INFO ] Implicit Places using invariants in 34 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/14 places, 6/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 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 3609 ms. Remains 2 /5 variables (removed 3) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 08:36:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 08:36:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 08:36:58] [INFO ] Invariant cache hit.
[2023-03-17 08:36:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/14 places, 2/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3696 ms. Remains : 2/14 places, 2/11 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-04 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:(GEQ s1 1)], 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 287 reset in 248 ms.
Product exploration explored 100000 steps with 336 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2023-03-17 08:36:59] [INFO ] Invariant cache hit.
[2023-03-17 08:36:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 08:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 08:36:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-17 08:36:59] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 08:36:59] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 08:36:59] [INFO ] Invariant cache hit.
[2023-03-17 08:36:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 08:36:59] [INFO ] Invariant cache hit.
[2023-03-17 08:36:59] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 08:36:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 08:36:59] [INFO ] Invariant cache hit.
[2023-03-17 08:36:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 2/2 places, 2/2 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-17 08:36:59] [INFO ] Invariant cache hit.
[2023-03-17 08:36:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 08:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 08:36:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-17 08:36:59] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 08:36:59] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9 reset in 57 ms.
Product exploration explored 100000 steps with 125 reset in 54 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-17 08:37:00] [INFO ] Invariant cache hit.
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 08:37:00] [INFO ] Invariant cache hit.
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-17 08:37:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 08:37:00] [INFO ] Invariant cache hit.
[2023-03-17 08:37:00] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property RobotManipulation-PT-10000-LTLFireability-04 finished in 5684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(G(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 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 13 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 11 transition count 9
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 7 place count 10 transition count 9
Applied a total of 7 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-17 08:37:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/14 places, 9/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 9 transition count 8
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 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 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
[2023-03-17 08:37:00] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 08:37:00] [INFO ] Invariant cache hit.
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/14 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 7/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s5 1) (GEQ s6 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-05 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 11 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-17 08:37:00] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 08:37:00] [INFO ] Invariant cache hit.
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-17 08:37:00] [INFO ] Invariant cache hit.
[2023-03-17 08:37:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1))], 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 6285 reset in 82 ms.
Stack based approach found an accepted trace after 841 steps with 59 reset with depth 8 and stack size 8 in 4 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-06 finished in 281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1) U X(X(p2)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-17 08:37:00] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 08:37:00] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 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 LTL mode , in 2 iterations and 35 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s11 1)), p0:(GEQ s8 1), p2:(GEQ s9 1)], 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 33333 reset in 62 ms.
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLFireability-07 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(!p0))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 11 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-17 08:37:01] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 08:37:01] [INFO ] Implicit Places using invariants in 30 ms returned [5]
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 : 10/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 197 ms :[p0, (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(GEQ s5 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 80 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) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLFireability-08 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-17 08:37:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 08:37:02] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 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 LTL mode , in 2 iterations and 26 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3335 reset in 90 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-09 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(G(p0))))||F(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 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2023-03-17 08:37:02] [INFO ] Invariant cache hit.
[2023-03-17 08:37:02] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s11 1)), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5424 reset in 100 ms.
Stack based approach found an accepted trace after 1428 steps with 196 reset with depth 24 and stack size 24 in 3 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-10 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 5 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 9
Applied a total of 5 rules in 4 ms. Remains 11 /14 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2023-03-17 08:37:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 08:37:02] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/14 places, 9/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 10 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 8
Applied a total of 2 rules in 1 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-17 08:37:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 08:37:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 08:37:02] [INFO ] Invariant cache hit.
[2023-03-17 08:37:02] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/14 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 9/14 places, 8/11 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1) (LT s8 1)), p1:(OR (LT s2 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3511 reset in 111 ms.
Stack based approach found an accepted trace after 94 steps with 2 reset with depth 27 and stack size 27 in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-11 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(p1)||F(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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 12 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 10
Applied a total of 3 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 08:37:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 08:37:03] [INFO ] Implicit Places using invariants in 31 ms returned [5]
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 : 11/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (LT s7 1) (OR (LT s0 1) (LT s4 1))), p1:(GEQ s7 1), p0:(OR (LT s2 1) (LT s8 1))], 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 7 reset in 99 ms.
Stack based approach found an accepted trace after 265 steps with 14 reset with depth 97 and stack size 97 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-12 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 9 transition count 8
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 8 transition count 7
Iterating global 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 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
Applied a total of 12 rules in 5 ms. Remains 7 /14 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-17 08:37:03] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 08:37:03] [INFO ] Implicit Places using invariants in 30 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/14 places, 6/11 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 7 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-17 08:37:03] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 08:37:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 08:37:03] [INFO ] Invariant cache hit.
[2023-03-17 08:37:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/14 places, 3/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 2/14 places, 3/11 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-14 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 11 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-17 08:37:03] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 08:37:03] [INFO ] Implicit Places using invariants in 31 ms returned [5]
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 : 10/14 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, true]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7 1), p1:(GEQ s9 1)], 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]]
Entered a terminal (fully accepting) state of product in 48 steps with 1 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-15 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-17 08:37:03] [INFO ] Flatten gal took : 4 ms
[2023-03-17 08:37:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 08:37:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 11 transitions and 32 arcs took 0 ms.
Total runtime 12886 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/980/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RobotManipulation-PT-10000-LTLFireability-04

BK_STOP 1679042224869

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name RobotManipulation-PT-10000-LTLFireability-04
ltl formula formula --ltl=/tmp/980/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 14 places, 11 transitions and 32 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RobotManipulation-PT-10000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r361-smll-167891810900100"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;