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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.3K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652943987871

Running Version 202205111006
[2022-05-19 07:06:28] [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 07:06:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:06:29] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2022-05-19 07:06:29] [INFO ] Transformed 15 places.
[2022-05-19 07:06:29] [INFO ] Transformed 11 transitions.
[2022-05-19 07:06:29] [INFO ] Parsed PT model containing 15 places and 11 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-01000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-01000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 6 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 07:06:29] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-19 07:06:29] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:06:29] [INFO ] Computed 6 place invariants in 18 ms
[2022-05-19 07:06:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:06:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 07:06:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2022-05-19 07:06:29] [INFO ] Flatten gal took : 13 ms
[2022-05-19 07:06:29] [INFO ] Flatten gal took : 3 ms
[2022-05-19 07:06:29] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:06:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 07:06:29] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 07:06:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 07:06:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:06:30] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 07:06:30] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-19 07:06:30] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9998 steps, including 0 resets, run visited all 3 properties in 176 ms. (steps per millisecond=56 )
Parikh walk visited 3 properties in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0)) U (F(G(p1))&&X(p2))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:06:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:06:30] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:06:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:30] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:06:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:06:30] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GT 1 s8), p0:(LEQ s5 s2), p1:(LEQ s8 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 253 ms.
Stack based approach found an accepted trace after 279 steps with 0 reset with depth 280 and stack size 278 in 1 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-00 finished in 680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !((G(p1)&&p2) U !X(X(p2)))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:06:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:06:31] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:06:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:06:31] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:06:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:06:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), true, (NOT p2), (AND p1 (NOT p2)), (AND p1 p0 (NOT p2)), (AND p1 p0 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=p1, acceptance={} source=2 dest: 9}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 9}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 10}], [{ cond=(AND p1 p0), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1 p0), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p1 p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 10}, { cond=p1, acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 11}], [{ cond=p1, acceptance={0} source=12 dest: 12}]], initial=0, aps=[p2:(LEQ s2 s11), p1:(LEQ s0 s5), p0:(LEQ s10 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40026 reset in 139 ms.
Product exploration explored 100000 steps with 40003 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 13 factoid took 483 ms. Reduced automaton from 13 states, 25 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-01000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-01000-LTLCardinality-01 finished in 1272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U !X((p1 U !p1)))&&p2))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:06:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:06:32] [INFO ] Implicit Places using invariants in 37 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p0) p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s1 s0), p0:(GT 3 s10), p1:(LEQ s10 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 201 steps with 0 reset with depth 202 and stack size 202 in 1 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-02 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 13 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-19 07:06:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:06:32] [INFO ] Implicit Places using invariants in 24 ms returned [9, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 9/11 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 9
Applied a total of 2 rules in 1 ms. Remains 9 /10 variables (removed 1) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:32] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-19 07:06:32] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/15 places, 9/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-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:(OR (GT s4 s8) (GT 2 s7))], 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 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) 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
Interrupted probabilistic random walk after 3010735 steps, run timeout after 3001 ms. (steps per millisecond=1003 ) properties seen :{}
Probabilistic random walk after 3010735 steps, saw 1072098 distinct states, run finished after 3003 ms. (steps per millisecond=1002 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:36] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-19 07:06:36] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:06:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-19 07:06:36] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:06:36] [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 2 ms.
[2022-05-19 07:06:36] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:36] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-19 07:06:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 9/9 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 2801281 steps, run timeout after 3001 ms. (steps per millisecond=933 ) properties seen :{}
Probabilistic random walk after 2801281 steps, saw 1002948 distinct states, run finished after 3001 ms. (steps per millisecond=933 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:06:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 07:06:40] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:06:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-19 07:06:40] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:06:40] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-19 07:06:40] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Built C files in :
/tmp/ltsmin8172500025138132987
[2022-05-19 07:06:40] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-19 07:06:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:06:40] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-19 07:06:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:06:40] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-19 07:06:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:06:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8172500025138132987
Running compilation step : cd /tmp/ltsmin8172500025138132987;'/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 139 ms.
Running link step : cd /tmp/ltsmin8172500025138132987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8172500025138132987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3461799660586380076.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:55] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:06:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-19 07:06:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-19 07:06:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:06:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin11221331977587939460
[2022-05-19 07:06:55] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-19 07:06:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:06:55] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-19 07:06:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:06:55] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-19 07:06:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:06:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11221331977587939460
Running compilation step : cd /tmp/ltsmin11221331977587939460;'/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 57 ms.
Running link step : cd /tmp/ltsmin11221331977587939460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin11221331977587939460;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17579192243991186218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 07:07:11] [INFO ] Flatten gal took : 1 ms
[2022-05-19 07:07:11] [INFO ] Flatten gal took : 1 ms
[2022-05-19 07:07:11] [INFO ] Time to serialize gal into /tmp/LTL10056703007603625838.gal : 2 ms
[2022-05-19 07:07:11] [INFO ] Time to serialize properties into /tmp/LTL14138346892422247994.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/LTL10056703007603625838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14138346892422247994.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/LTL1005670...268
Read 1 LTL properties
Checking formula 0 : !((G(F("((r_active>initialized)||(p_m<2))"))))
Formula 0 simplified : !GF"((r_active>initialized)||(p_m<2))"
Detected timeout of ITS tools.
[2022-05-19 07:07:26] [INFO ] Flatten gal took : 3 ms
[2022-05-19 07:07:26] [INFO ] Applying decomposition
[2022-05-19 07:07:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4600244456692415975.txt' '-o' '/tmp/graph4600244456692415975.bin' '-w' '/tmp/graph4600244456692415975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4600244456692415975.bin' '-l' '-1' '-v' '-w' '/tmp/graph4600244456692415975.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:07:26] [INFO ] Decomposing Gal with order
[2022-05-19 07:07:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:07:26] [INFO ] Removed a total of 4 redundant transitions.
[2022-05-19 07:07:26] [INFO ] Flatten gal took : 28 ms
[2022-05-19 07:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2022-05-19 07:07:26] [INFO ] Time to serialize gal into /tmp/LTL3291727731926079081.gal : 1 ms
[2022-05-19 07:07:26] [INFO ] Time to serialize properties into /tmp/LTL3428569077023513021.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/LTL3291727731926079081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3428569077023513021.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/LTL3291727...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu3.r_active>gu3.initialized)||(gi0.gu2.p_m<2))"))))
Formula 0 simplified : !GF"((gu3.r_active>gu3.initialized)||(gi0.gu2.p_m<2))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin163285838596522371
[2022-05-19 07:07:41] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin163285838596522371
Running compilation step : cd /tmp/ltsmin163285838596522371;'/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 65 ms.
Running link step : cd /tmp/ltsmin163285838596522371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin163285838596522371;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-01000-LTLCardinality-03 finished in 83471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1) U !F(X((F(X(G(p2)))&&p0))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:07:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:07:56] [INFO ] Implicit Places using invariants in 21 ms returned [5]
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 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 p2), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 p1 p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=10 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s1), p2:(LEQ s9 s12), p1:(LEQ 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 86 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 p2) (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 510 ms. Reduced automaton from 11 states, 25 edges and 3 AP to 11 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 313 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2002 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:07:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:07:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 07:07:58] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 07:07:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 07:07:58] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:07:58] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-19 07:07:58] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 7997 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1142 )
Parikh walk visited 4 properties in 189 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 p1 p2)), (F p0), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 13 factoid took 821 ms. Reduced automaton from 11 states, 25 edges and 3 AP to 11 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 336 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 307 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:07:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:07:59] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:07:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:07:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:07:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:07:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/13 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 482 ms. Reduced automaton from 11 states, 25 edges and 3 AP to 11 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 309 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:08:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:08:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 07:08:00] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 07:08:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 07:08:00] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 07:08:00] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 07:08:00] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 7997 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1142 )
Parikh walk visited 4 properties in 130 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 p1 p2)), (F p0), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 13 factoid took 790 ms. Reduced automaton from 11 states, 25 edges and 3 AP to 11 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 309 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 325 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 291 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 301 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2 p1), p2, p2, (AND p0 p2), (AND p2 p0 p1), (AND p2 p0), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1)]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 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 13 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 13 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 13 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 12 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 12 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2022-05-19 07:08:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 07:08:03] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:08:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/13 places, 10/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/13 places, 10/11 transitions.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Built C files in :
/tmp/ltsmin8586755923368939071
[2022-05-19 07:08:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8586755923368939071
Running compilation step : cd /tmp/ltsmin8586755923368939071;'/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 54 ms.
Running link step : cd /tmp/ltsmin8586755923368939071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 16 ms.
Running LTSmin : cd /tmp/ltsmin8586755923368939071;'/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/stateBased1742731881229514402.hoa' '--buchi-type=spotba'
LTSmin run took 2307 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-01000-LTLCardinality-05 finished in 9661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(p0))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:08:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 17 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:08:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:08:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}]], initial=3, aps=[p1:(LEQ s5 s4), p0:(LEQ s8 s1)], 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 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-01000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-01000-LTLCardinality-06 finished in 424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G((p0 U !p0)))&&!p0))))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 16 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:08:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:08:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:08:06] [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 LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, p0, p0]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 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 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-07 finished in 155 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(G(F(p0))))))))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 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 13 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 11 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 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 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 4 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-19 07:08:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 24 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/15 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 1 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 2 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 07:08:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 07:08:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/15 places, 3/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/15 places, 3/11 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-08 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 2 s1)], 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-01000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-08 finished in 128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X(G(p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:08:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 18 ms returned [11]
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 : 13/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 0 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 07:08:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 07:08:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 12/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 1 s5), p1:(LEQ s7 s9)], 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 6 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-09 finished in 175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(X(p1))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:08:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:08:06] [INFO ] Implicit Places using invariants in 16 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s11 s6), p0:(LEQ s5 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 2890 steps with 0 reset with depth 2891 and stack size 2881 in 4 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-10 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(p1)&&p1)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:08:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:08:07] [INFO ] Implicit Places using invariants in 19 ms returned [5]
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 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 3 s9), p0:(LEQ 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 48 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 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-01000-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-01000-LTLCardinality-12 finished in 364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(X(p0))||p1))&&F(!p0)&&!p1)))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:08:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:08:07] [INFO ] Implicit Places using invariants in 16 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, true, true, p0, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT s7 s9), p0:(GT s8 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-14 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-19 07:08:07] [INFO ] Flatten gal took : 1 ms
Using solver Z3 to compute partial order matrices.
[2022-05-19 07:08:07] [INFO ] Applying decomposition
[2022-05-19 07:08:07] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin2219748012857439141
[2022-05-19 07:08:07] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-19 07:08:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:08:07] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-19 07:08:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:08:07] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-19 07:08:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:08:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2219748012857439141
Running compilation step : cd /tmp/ltsmin2219748012857439141;'/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/graph2345402284953554207.txt' '-o' '/tmp/graph2345402284953554207.bin' '-w' '/tmp/graph2345402284953554207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2345402284953554207.bin' '-l' '-1' '-v' '-w' '/tmp/graph2345402284953554207.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:08:07] [INFO ] Decomposing Gal with order
[2022-05-19 07:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:08:07] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-19 07:08:07] [INFO ] Flatten gal took : 2 ms
[2022-05-19 07:08:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-05-19 07:08:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality5221550830626972766.gal : 1 ms
[2022-05-19 07:08:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality500628987836343194.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/LTLCardinality5221550830626972766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality500628987836343194.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...287
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu3.r_active>gu3.initialized)||(gi1.gu4.p_m<2))"))))
Formula 0 simplified : !GF"((gu3.r_active>gu3.initialized)||(gi1.gu4.p_m<2))"
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin2219748012857439141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 17 ms.
Running LTSmin : cd /tmp/ltsmin2219748012857439141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: 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.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 12, guards 11
pins2lts-mc-linux64( 0/ 8), 0.024: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.024: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.033: There are 14 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.033: State length is 16, there are 14 groups
pins2lts-mc-linux64( 0/ 8), 0.033: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.033: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.033: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.033: Visible groups: 0 / 14, labels: 1 / 14
pins2lts-mc-linux64( 0/ 8), 0.033: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.033: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.040: [Blue] ~120 levels ~1920 states ~960 transitions
pins2lts-mc-linux64( 3/ 8), 0.040: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 7/ 8), 0.117: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.209: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 6/ 8), 0.329: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 2/ 8), 0.587: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 5/ 8), 2.029: [Blue] ~7680 levels ~61440 states ~81056 transitions
pins2lts-mc-linux64( 7/ 8), 3.517: [Blue] ~15360 levels ~122880 states ~238264 transitions
pins2lts-mc-linux64( 6/ 8), 4.616: [Blue] ~30717 levels ~245760 states ~545808 transitions
pins2lts-mc-linux64( 7/ 8), 5.737: [Blue] ~61440 levels ~491520 states ~1057576 transitions
pins2lts-mc-linux64( 0/ 8), 7.141: [Blue] ~122836 levels ~983040 states ~2444936 transitions
pins2lts-mc-linux64( 5/ 8), 9.964: [Blue] ~245749 levels ~1966080 states ~3304424 transitions
pins2lts-mc-linux64( 0/ 8), 12.223: [Blue] ~490985 levels ~3932160 states ~9051816 transitions
pins2lts-mc-linux64( 0/ 8), 15.345: [Blue] ~982505 levels ~7864320 states ~20188024 transitions
pins2lts-mc-linux64( 0/ 8), 22.288: [Blue] ~1965545 levels ~15728640 states ~42461944 transitions
pins2lts-mc-linux64( 0/ 8), 39.456: [Blue] ~3927009 levels ~31457280 states ~78276096 transitions
pins2lts-mc-linux64( 1/ 8), 96.899: [Blue] ~7864317 levels ~62914560 states ~75595888 transitions
pins2lts-mc-linux64( 1/ 8), 108.247: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 108.261:
pins2lts-mc-linux64( 0/ 8), 108.261: Explored 51787264 states 66848053 transitions, fanout: 1.291
pins2lts-mc-linux64( 0/ 8), 108.261: Total exploration time 108.210 sec (108.180 sec minimum, 108.199 sec on average)
pins2lts-mc-linux64( 0/ 8), 108.261: States per second: 478581, Transitions per second: 617762
pins2lts-mc-linux64( 0/ 8), 108.261:
pins2lts-mc-linux64( 0/ 8), 108.261: State space has 82424261 states, 4120 are accepting
pins2lts-mc-linux64( 0/ 8), 108.261: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 108.261: blue states: 51787264 (62.83%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 108.261: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 108.261: all-red states: 4120 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 108.261:
pins2lts-mc-linux64( 0/ 8), 108.261: Total memory used for local state coloring: 784.3MB
pins2lts-mc-linux64( 0/ 8), 108.261:
pins2lts-mc-linux64( 0/ 8), 108.261: Queue width: 8B, total height: 51403132, memory: 392.17MB
pins2lts-mc-linux64( 0/ 8), 108.261: Tree memory: 884.8MB, 11.3 B/state, compr.: 17.1%
pins2lts-mc-linux64( 0/ 8), 108.261: Tree fill ratio (roots/leafs): 61.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 108.261: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 108.261: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 108.261: Est. total memory use: 1277.0MB (~1416.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2219748012857439141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2219748012857439141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==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 07:28:41] [INFO ] Flatten gal took : 153 ms
[2022-05-19 07:28:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality6837359544779173092.gal : 21 ms
[2022-05-19 07:28:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality17716164336814591244.ltl : 4 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/LTLCardinality6837359544779173092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17716164336814591244.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...289
Read 1 LTL properties
Checking formula 0 : !((G(F("((r_active>initialized)||(p_m<2))"))))
Formula 0 simplified : !GF"((r_active>initialized)||(p_m<2))"
Detected timeout of ITS tools.
[2022-05-19 07:49:14] [INFO ] Flatten gal took : 184 ms
[2022-05-19 07:49:15] [INFO ] Input system was already deterministic with 11 transitions.
[2022-05-19 07:49:15] [INFO ] Transformed 15 places.
[2022-05-19 07:49:15] [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 07:49:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality2742449965386993263.gal : 4 ms
[2022-05-19 07:49:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality833131193992636928.ltl : 4 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/LTLCardinality2742449965386993263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality833131193992636928.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 : !((G(F("((r_active>initialized)||(p_m<2))"))))
Formula 0 simplified : !GF"((r_active>initialized)||(p_m<2))"

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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-01000"
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-01000, 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-165281598800075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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