Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.3K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620998619895

Running Version 0
[2021-05-14 13:23:43] [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]
[2021-05-14 13:23:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 13:23:43] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-14 13:23:43] [INFO ] Transformed 15 places.
[2021-05-14 13:23:43] [INFO ] Transformed 11 transitions.
[2021-05-14 13:23:43] [INFO ] Parsed PT model containing 15 places and 11 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 13:23:43] [INFO ] Initial state test concluded for 4 properties.
FORMULA RobotManipulation-PT-10000-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 11 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:23:43] [INFO ] Computed 6 place invariants in 11 ms
[2021-05-14 13:23:43] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:23:43] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-14 13:23:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:23:43] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-14 13:23:43] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 13:23:43] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 13:23:43] [INFO ] Flatten gal took : 25 ms
FORMULA RobotManipulation-PT-10000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 13:23:43] [INFO ] Flatten gal took : 7 ms
[2021-05-14 13:23:44] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100010 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=1818 ) properties (out of 16) seen :1
Running SMT prover for 15 properties.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 13:23:44] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 25 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:44] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:23:44] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:44] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-14 13:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:45] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:45] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:45] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:45] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 13:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 13:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:23:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 13:23:45] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 13:23:45] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-14 13:23:45] [INFO ] Initial state test concluded for 1 properties.
FORMULA RobotManipulation-PT-10000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 20 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-14 13:23:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 13:23:45] [INFO ] Implicit Places using invariants in 32 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
[2021-05-14 13:23:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 13:23:45] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 13:23:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 7/15 places, 7/11 transitions.
Graph (trivial) has 4 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 4
Applied a total of 4 rules in 9 ms. Remains 3 /7 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 13:23:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 13:23:45] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 13:23:45] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-14 13:23:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 2 ms.
FORMULA RobotManipulation-PT-10000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-02 finished in 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:23:45] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:23:46] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:23:46] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-14 13:23:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, 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 4 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:23:46] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:23:46] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:23:46] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 13:23:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 575 reset in 438 ms.
Stack based approach found an accepted trace after 138 steps with 0 reset with depth 139 and stack size 139 in 2 ms.
FORMULA RobotManipulation-PT-10000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-03 finished in 651 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X((F(G(p1)) U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:23:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:23:46] [INFO ] Implicit Places using invariants in 27 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:23:46] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 13:23:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:23:46] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 13:23:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s7 s4), p2:(LEQ s8 s2), p1:(GT s6 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 475 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 5 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 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 1 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-14 13:23:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:23:48] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:23:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 292 ms.
[2021-05-14 13:23:49] [INFO ] Flatten gal took : 5 ms
[2021-05-14 13:23:49] [INFO ] Flatten gal took : 4 ms
[2021-05-14 13:23:49] [INFO ] Time to serialize gal into /tmp/LTL16627721207389559896.gal : 2 ms
[2021-05-14 13:23:49] [INFO ] Time to serialize properties into /tmp/LTL307398580364545963.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16627721207389559896.gal, -t, CGAL, -LTL, /tmp/LTL307398580364545963.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16627721207389559896.gal -t CGAL -LTL /tmp/LTL307398580364545963.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p_sc<=r_stopped)")||(X((F(G("(p_rdy>r_stopped)")))U("(p_rel<=moved)")))))))
Formula 0 simplified : !XG("(p_sc<=r_stopped)" | X(FG"(p_rdy>r_stopped)" U "(p_rel<=moved)"))
Detected timeout of ITS tools.
[2021-05-14 13:24:04] [INFO ] Flatten gal took : 3 ms
[2021-05-14 13:24:04] [INFO ] Applying decomposition
[2021-05-14 13:24:04] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1820715234685112439.txt, -o, /tmp/graph1820715234685112439.bin, -w, /tmp/graph1820715234685112439.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1820715234685112439.bin, -l, -1, -v, -w, /tmp/graph1820715234685112439.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:24:04] [INFO ] Decomposing Gal with order
[2021-05-14 13:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:24:04] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 13:24:04] [INFO ] Flatten gal took : 34 ms
[2021-05-14 13:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 13:24:04] [INFO ] Time to serialize gal into /tmp/LTL13022101469521118053.gal : 1 ms
[2021-05-14 13:24:04] [INFO ] Time to serialize properties into /tmp/LTL17876727878524210135.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13022101469521118053.gal, -t, CGAL, -LTL, /tmp/LTL17876727878524210135.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13022101469521118053.gal -t CGAL -LTL /tmp/LTL17876727878524210135.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu1.p_sc<=gu1.r_stopped)")||(X((F(G("(gu1.p_rdy>gu1.r_stopped)")))U("(gu3.p_rel<=gu3.moved)")))))))
Formula 0 simplified : !XG("(gu1.p_sc<=gu1.r_stopped)" | X(FG"(gu1.p_rdy>gu1.r_stopped)" U "(gu3.p_rel<=gu3.moved)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11425815379302653986
[2021-05-14 13:24:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11425815379302653986
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11425815379302653986]
Compilation finished in 441 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11425815379302653986]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((LTLAPp0==true)||X((<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11425815379302653986]
LTSmin run took 1091 ms.
FORMULA RobotManipulation-PT-10000-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-04 finished in 34741 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:24:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, 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 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-06 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-14 13:24:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 17 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 18 ms to find 3 implicit places.
[2021-05-14 13:24:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 7/15 places, 7/11 transitions.
Graph (trivial) has 5 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 4
Applied a total of 4 rules in 1 ms. Remains 3 /7 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 13:24:21] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 13:24:21] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-07 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:24:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, 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
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:24:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s2 s5) (LEQ 1 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-10000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-08 finished in 183 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:24:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Implicit Places using invariants in 15 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 13:24:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 13:24:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 13:24:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:24:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s9 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 314 steps with 0 reset with depth 315 and stack size 315 in 2 ms.
FORMULA RobotManipulation-PT-10000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-09 finished in 491 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-14 13:24:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, 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 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-10 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 4 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-14 13:24:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants in 26 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
[2021-05-14 13:24:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 13:24:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 13:24:22] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 9/15 places, 8/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 6 transition count 6
Applied a total of 5 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RobotManipulation-PT-10000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-11 finished in 300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 8
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 8 place count 10 transition count 8
Applied a total of 8 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 13:24:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants in 19 ms returned [4, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-14 13:24:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 13:24:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 8/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 5
Applied a total of 6 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 13:24:22] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 13:24:22] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s3 s4), p0:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 219 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
[2021-05-14 13:24:23] [INFO ] Flatten gal took : 2 ms
[2021-05-14 13:24:23] [INFO ] Flatten gal took : 6 ms
[2021-05-14 13:24:23] [INFO ] Time to serialize gal into /tmp/LTL7084630486868258439.gal : 1 ms
[2021-05-14 13:24:23] [INFO ] Time to serialize properties into /tmp/LTL16598676753110266206.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7084630486868258439.gal, -t, CGAL, -LTL, /tmp/LTL16598676753110266206.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7084630486868258439.gal -t CGAL -LTL /tmp/LTL16598676753110266206.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G("(p_rdy>=2)")))||(G("(p_sc<=access)"))))
Formula 0 simplified : !(FG"(p_rdy>=2)" | G"(p_sc<=access)")
Detected timeout of ITS tools.
[2021-05-14 13:24:38] [INFO ] Flatten gal took : 1 ms
[2021-05-14 13:24:38] [INFO ] Applying decomposition
[2021-05-14 13:24:38] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13295933628142244238.txt, -o, /tmp/graph13295933628142244238.bin, -w, /tmp/graph13295933628142244238.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13295933628142244238.bin, -l, -1, -v, -w, /tmp/graph13295933628142244238.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:24:38] [INFO ] Decomposing Gal with order
[2021-05-14 13:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:24:38] [INFO ] Flatten gal took : 1 ms
[2021-05-14 13:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 13:24:38] [INFO ] Time to serialize gal into /tmp/LTL13468171919122839162.gal : 0 ms
[2021-05-14 13:24:38] [INFO ] Time to serialize properties into /tmp/LTL11777850695980746159.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13468171919122839162.gal, -t, CGAL, -LTL, /tmp/LTL11777850695980746159.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13468171919122839162.gal -t CGAL -LTL /tmp/LTL11777850695980746159.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G("(gu0.p_rdy>=2)")))||(G("(gu1.p_sc<=gu1.access)"))))
Formula 0 simplified : !(FG"(gu0.p_rdy>=2)" | G"(gu1.p_sc<=gu1.access)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13388652906851218829
[2021-05-14 13:24:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13388652906851218829
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13388652906851218829]
Compilation finished in 130 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13388652906851218829]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13388652906851218829]
LTSmin run took 3162 ms.
FORMULA RobotManipulation-PT-10000-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-12 finished in 34302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, 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 3 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-14 13:24:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 13:24:57] [INFO ] Implicit Places using invariants in 19 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
[2021-05-14 13:24:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 13:24:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 13:24:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, 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 0 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 1 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-14 13:24:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 13:24:57] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-14 13:24:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 13:24:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/15 places, 3/11 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-13 automaton TGBA [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:(GT 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 20 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-13 finished in 157 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620998698455

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-10000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-162089451900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-10000.tgz
mv RobotManipulation-PT-10000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;