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.r140-tall-162089127800373.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-00
FORMULA_NAME ParamProductionCell-PT-1-01
FORMULA_NAME ParamProductionCell-PT-1-02
FORMULA_NAME ParamProductionCell-PT-1-03
FORMULA_NAME ParamProductionCell-PT-1-04
FORMULA_NAME ParamProductionCell-PT-1-05
FORMULA_NAME ParamProductionCell-PT-1-06
FORMULA_NAME ParamProductionCell-PT-1-07
FORMULA_NAME ParamProductionCell-PT-1-08
FORMULA_NAME ParamProductionCell-PT-1-09
FORMULA_NAME ParamProductionCell-PT-1-10
FORMULA_NAME ParamProductionCell-PT-1-11
FORMULA_NAME ParamProductionCell-PT-1-12
FORMULA_NAME ParamProductionCell-PT-1-13
FORMULA_NAME ParamProductionCell-PT-1-14
FORMULA_NAME ParamProductionCell-PT-1-15

=== Now, execution of the tool begins

BK_START 1620979567185

Running Version 0
[2021-05-14 08:06:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 08:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:06:09] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2021-05-14 08:06:09] [INFO ] Transformed 231 places.
[2021-05-14 08:06:09] [INFO ] Transformed 202 transitions.
[2021-05-14 08:06:09] [INFO ] Found NUPN structural information;
[2021-05-14 08:06:09] [INFO ] Parsed PT model containing 231 places and 202 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:06:09] [INFO ] Initial state test concluded for 4 properties.
FORMULA ParamProductionCell-PT-1-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 231 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 40 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2021-05-14 08:06:09] [INFO ] Computed 59 place invariants in 13 ms
[2021-05-14 08:06:09] [INFO ] Implicit Places using invariants in 246 ms returned [1, 15, 16, 18, 24, 31, 35, 36, 47, 59, 65, 73, 79, 98, 114, 116, 118, 119, 160, 162, 164, 165, 188, 190, 191, 200, 201, 205, 216]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 273 ms to find 29 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:09] [INFO ] Computed 30 place invariants in 4 ms
[2021-05-14 08:06:09] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Starting structural reductions, iteration 1 : 196/231 places, 196/202 transitions.
Applied a total of 0 rules in 18 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:09] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-14 08:06:09] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 196/231 places, 196/202 transitions.
[2021-05-14 08:06:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 08:06:09] [INFO ] Flatten gal took : 43 ms
FORMULA ParamProductionCell-PT-1-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:06:09] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:06:09] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=296 ) properties (out of 29) seen :21
Running SMT prover for 8 properties.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:10] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-14 08:06:10] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:10] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-14 08:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:10] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 08:06:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:10] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:10] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-14 08:06:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:06:10] [INFO ] [Nat]Added 68 Read/Feed constraints in 8 ms returned sat
[2021-05-14 08:06:10] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2021-05-14 08:06:10] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2021-05-14 08:06:10] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2021-05-14 08:06:10] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
[2021-05-14 08:06:10] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 1 ms to minimize.
[2021-05-14 08:06:10] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 5 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 85 places in 37 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 679 ms
[2021-05-14 08:06:11] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:11] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:11] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 08:06:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-14 08:06:11] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 08:06:11] [INFO ] [Nat]Added 68 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 80 places in 46 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2021-05-14 08:06:11] [INFO ] Deduced a trap composed of 75 places in 33 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 582 ms
[2021-05-14 08:06:12] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:12] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Real]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:06:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:12] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 92 places in 38 ms of which 0 ms to minimize.
[2021-05-14 08:06:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 539 ms
[2021-05-14 08:06:12] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:12] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 08:06:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:12] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-14 08:06:12] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:06:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 287 ms
[2021-05-14 08:06:13] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:13] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:13] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-14 08:06:13] [INFO ] [Real]Added 68 Read/Feed constraints in 9 ms returned sat
[2021-05-14 08:06:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:13] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-14 08:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:13] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 08:06:13] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2021-05-14 08:06:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 520 ms
[2021-05-14 08:06:13] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2021-05-14 08:06:14] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:14] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Real]Added 68 Read/Feed constraints in 6 ms returned sat
[2021-05-14 08:06:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:14] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Nat]Added 68 Read/Feed constraints in 9 ms returned sat
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 87 places in 36 ms of which 1 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2021-05-14 08:06:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 596 ms
[2021-05-14 08:06:14] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:14] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Real]Added 68 Read/Feed constraints in 5 ms returned sat
[2021-05-14 08:06:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:06:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:06:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 08:06:14] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:06:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2021-05-14 08:06:15] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2021-05-14 08:06:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2021-05-14 08:06:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2021-05-14 08:06:15] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 2 ms to minimize.
[2021-05-14 08:06:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2021-05-14 08:06:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 255 ms
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
[2021-05-14 08:06:15] [INFO ] Initial state test concluded for 3 properties.
FORMULA ParamProductionCell-PT-1-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:15] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-14 08:06:15] [INFO ] Implicit Places using invariants in 108 ms returned [15, 33, 34, 38, 54, 66, 85, 87, 99, 141, 169, 170]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 109 ms to find 12 implicit places.
// Phase 1: matrix 196 rows 184 cols
[2021-05-14 08:06:15] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-14 08:06:15] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 184/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 9 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2021-05-14 08:06:15] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:15] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 194 rows 182 cols
[2021-05-14 08:06:15] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-14 08:06:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:06:15] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 182/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-01 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 (EQ s16 0) (EQ s21 0))], 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 105 steps with 0 reset in 3 ms.
FORMULA ParamProductionCell-PT-1-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-01 finished in 659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))&&F((p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 196 transition count 169
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 169 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 167 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 58 place count 167 transition count 155
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 155 transition count 155
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 130 place count 131 transition count 131
Applied a total of 130 rules in 29 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2021-05-14 08:06:15] [INFO ] Computed 30 place invariants in 4 ms
[2021-05-14 08:06:16] [INFO ] Implicit Places using invariants in 86 ms returned [1, 5, 9, 10, 20, 21, 37, 44, 49, 54, 56, 67, 83, 95, 114]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 87 ms to find 15 implicit places.
[2021-05-14 08:06:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 131 rows 116 cols
[2021-05-14 08:06:16] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 08:06:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 116/196 places, 131/196 transitions.
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 2 rules applied. Total rules applied 2 place count 116 transition count 129
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 114 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 113 transition count 128
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6 place count 113 transition count 123
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16 place count 108 transition count 123
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 68 place count 82 transition count 97
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 70 place count 81 transition count 96
Applied a total of 70 rules in 14 ms. Remains 81 /116 variables (removed 35) and now considering 96/131 (removed 35) transitions.
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:16] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 08:06:16] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:16] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 08:06:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:06:16] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 81/196 places, 96/196 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s67 1) (NEQ s73 1)), p2:(AND (OR (NEQ s64 1) (NEQ s65 1) (NEQ s71 1)) (OR (NEQ s12 1) (NEQ s13 1) (NEQ s17 1))), p1:(OR (NEQ s12 1) (NEQ s13 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1076 reset in 222 ms.
Product exploration explored 100000 steps with 1129 reset in 154 ms.
Knowledge obtained : [p0, p2, p1]
Adopting property with smaller alphabet thanks to knowledge :p2
Stuttering acceptance computed with spot in 75 ms :[(AND p2 (NOT p0)), (NOT p0), (NOT p0)]
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 96/96 transitions.
Applied a total of 0 rules in 13 ms. Remains 81 /81 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:16] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 08:06:17] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:17] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 08:06:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:06:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2021-05-14 08:06:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:17] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 08:06:17] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 96/96 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p2 (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1091 reset in 147 ms.
Product exploration explored 100000 steps with 1080 reset in 135 ms.
[2021-05-14 08:06:17] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:06:17] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:06:17] [INFO ] Time to serialize gal into /tmp/LTL13074547181630467026.gal : 3 ms
[2021-05-14 08:06:17] [INFO ] Time to serialize properties into /tmp/LTL17767124965730396692.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/LTL13074547181630467026.gal, -t, CGAL, -LTL, /tmp/LTL17767124965730396692.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/LTL13074547181630467026.gal -t CGAL -LTL /tmp/LTL17767124965730396692.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("((crane_above_deposit_belt!=1)||(CU_trans_run!=1))")))&&(F(("(((table_top_pos!=1)||(table_upward!=1))||(TL_lower_run!=1))")U(("((((crane_release_height!=1)||(crane_lift!=1))||(CU_lift_run!=1))&&(((table_top_pos!=1)||(table_upward!=1))||(TL_lower_run!=1)))")||(G("(((table_top_pos!=1)||(table_upward!=1))||(TL_lower_run!=1))")))))))
Formula 0 simplified : !(GF"((crane_above_deposit_belt!=1)||(CU_trans_run!=1))" & F("(((table_top_pos!=1)||(table_upward!=1))||(TL_lower_run!=1))" U ("((((crane_release_height!=1)||(crane_lift!=1))||(CU_lift_run!=1))&&(((table_top_pos!=1)||(table_upward!=1))||(TL_lower_run!=1)))" | G"(((table_top_pos!=1)||(table_upward!=1))||(TL_lower_run!=1))")))
Reverse transition relation is NOT exact ! Due to transitions t177, t175.t168.t48.t49.t54, t170.t173, t183.t194, t79.t71.t85, t88.t87.t64.t36.t37.t42.t65, t110.t109.t66.t2.t14.t62, t147.t146.t160, t163.t162.t117.t0.t10.t118, t192.t190, t20.t26, t32.t30, t140.t139.t119.t115.t18.t22, t57.t56.t50.t51.t16.t34, t98.t94.t107, t131.t124.t137, t189.t188.t169.t167.t181, t45.t44.t38.t39.t166.t186, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :24/54/18/96
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.160912,23204,1,0,140,22071,201,76,2606,15795,238
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-1-03 finished in 1848 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 196 transition count 169
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 169 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 167 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 58 place count 167 transition count 155
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 155 transition count 155
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 130 place count 131 transition count 131
Applied a total of 130 rules in 17 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2021-05-14 08:06:17] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:17] [INFO ] Implicit Places using invariants in 96 ms returned [1, 5, 9, 10, 20, 21, 24, 36, 43, 48, 54, 56, 84, 96, 114, 115]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 97 ms to find 16 implicit places.
[2021-05-14 08:06:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 131 rows 115 cols
[2021-05-14 08:06:17] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 08:06:17] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 115/196 places, 131/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 128
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 128
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 112 transition count 122
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 106 transition count 122
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 76 place count 77 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 76 transition count 92
Applied a total of 78 rules in 10 ms. Remains 76 /115 variables (removed 39) and now considering 92/131 (removed 39) transitions.
// Phase 1: matrix 92 rows 76 cols
[2021-05-14 08:06:17] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 08:06:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 92 rows 76 cols
[2021-05-14 08:06:17] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 08:06:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:06:18] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 76/196 places, 92/196 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-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:(OR (AND (EQ s38 1) (EQ s47 1)) (AND (EQ s12 1) (EQ s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4545 reset in 108 ms.
Product exploration explored 100000 steps with 4545 reset in 261 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4545 reset in 98 ms.
Product exploration explored 100000 steps with 4545 reset in 161 ms.
[2021-05-14 08:06:18] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:06:18] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:06:18] [INFO ] Time to serialize gal into /tmp/LTL14635753231238502225.gal : 3 ms
[2021-05-14 08:06:18] [INFO ] Time to serialize properties into /tmp/LTL3969918089832452997.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/LTL14635753231238502225.gal, -t, CGAL, -LTL, /tmp/LTL3969918089832452997.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/LTL14635753231238502225.gal -t CGAL -LTL /tmp/LTL3969918089832452997.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((arm2_forward==1)&&(A2L_ext_rs==1))||((table_top_pos==1)&&(TU_lift_run==1)))"))))
Formula 0 simplified : !GF"(((arm2_forward==1)&&(A2L_ext_rs==1))||((table_top_pos==1)&&(TU_lift_run==1)))"
Reverse transition relation is NOT exact ! Due to transitions t85, t83.t82.t89, t105.t104.t111, t175.t168.t48.t49.t54, t88.t87.t64.t36.t37.t42.t65, t110.t109.t66.t2.t14.t62, t147.t146.t160, t163.t162.t117.t0.t10.t118, t32.t30, t94.t107, t140.t139.t119.t115.t18.t22, t21.t20.t26, t57.t56.t50.t51.t16.t34, t131.t124.t137, t172.t171.t177, t189.t188.t169.t167.t181, t193.t192.t190, t45.t44.t38.t39.t166.t186, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :24/50/18/92
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.174687,23736,1,0,202,27150,190,72,2437,18830,388
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ParamProductionCell-PT-1-07 finished in 1319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((G(p1)||p0)) U (G((G(p1)||p3))&&p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:19] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:19] [INFO ] Implicit Places using invariants in 101 ms returned [15, 33, 34, 38, 54, 85, 87, 99, 141, 170]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 102 ms to find 10 implicit places.
// Phase 1: matrix 196 rows 186 cols
[2021-05-14 08:06:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:06:19] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 186/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 6 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2021-05-14 08:06:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:06:19] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2021-05-14 08:06:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:06:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:06:19] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 184/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-1-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p2 p3 p0) (AND p2 p1)), acceptance={0} source=1 dest: 6}, { cond=(AND p2 (NOT p3) p1 p0), acceptance={1} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 p0) p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p3) p1 p0), acceptance={1} source=6 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0, 1} source=7 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={} source=7 dest: 2}, { cond=(OR (AND (NOT p2) p1 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=7 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={1} source=7 dest: 7}, { cond=(AND p2 p3 p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=8 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p3) p1 p0), acceptance={1} source=8 dest: 7}, { cond=(AND p3 p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s61 1) (EQ s67 1)), p1:(OR (NEQ s61 1) (NEQ s67 1)), p0:(OR (NEQ s158 1) (NEQ s166 1)), p3:(OR (NEQ s158 1) (NEQ s166 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-08 finished in 791 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U (p1&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 196 transition count 171
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 171 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 170 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 52 place count 170 transition count 157
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 78 place count 157 transition count 157
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 130 place count 131 transition count 131
Applied a total of 130 rules in 17 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2021-05-14 08:06:19] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:19] [INFO ] Implicit Places using invariants in 78 ms returned [1, 5, 9, 10, 21, 24, 35, 48, 53, 55, 66, 82, 94, 114, 115]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 79 ms to find 15 implicit places.
[2021-05-14 08:06:19] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 131 rows 116 cols
[2021-05-14 08:06:19] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 08:06:20] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 116/196 places, 131/196 transitions.
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 2 rules applied. Total rules applied 2 place count 116 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 129
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 114 transition count 125
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 110 transition count 125
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 68 place count 82 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 81 transition count 96
Applied a total of 70 rules in 10 ms. Remains 81 /116 variables (removed 35) and now considering 96/131 (removed 35) transitions.
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:20] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 08:06:20] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2021-05-14 08:06:20] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 08:06:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:06:20] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 81/196 places, 96/196 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-1-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s61 1), p0:(AND (EQ s27 1) (EQ s29 1) (EQ s34 1)), p2:(AND (EQ s11 1) (EQ s13 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA ParamProductionCell-PT-1-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-10 finished in 507 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 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:20] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:20] [INFO ] Implicit Places using invariants in 105 ms returned [15, 33, 34, 38, 54, 66, 85, 87, 99, 141, 169, 170]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 106 ms to find 12 implicit places.
// Phase 1: matrix 196 rows 184 cols
[2021-05-14 08:06:20] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:20] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 184/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 5 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2021-05-14 08:06:20] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:20] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 194 rows 182 cols
[2021-05-14 08:06:20] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:06:20] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 182/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s117 1)], 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 1428 reset in 106 ms.
Product exploration explored 100000 steps with 1428 reset in 123 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 108 ms.
Product exploration explored 100000 steps with 1428 reset in 122 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 182/182 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 182 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 38 place count 182 transition count 194
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 182 transition count 194
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 171 transition count 183
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 171 transition count 183
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 119 place count 171 transition count 183
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 148 place count 142 transition count 154
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 177 place count 142 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 142 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 141 transition count 153
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 141 transition count 153
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 180 rules in 34 ms. Remains 141 /182 variables (removed 41) and now considering 153/194 (removed 41) transitions.
[2021-05-14 08:06:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 153 rows 141 cols
[2021-05-14 08:06:21] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:21] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 141/182 places, 153/194 transitions.
Product exploration explored 100000 steps with 2941 reset in 220 ms.
Product exploration explored 100000 steps with 2941 reset in 201 ms.
[2021-05-14 08:06:22] [INFO ] Flatten gal took : 9 ms
[2021-05-14 08:06:22] [INFO ] Flatten gal took : 9 ms
[2021-05-14 08:06:22] [INFO ] Time to serialize gal into /tmp/LTL3020856592367560421.gal : 3 ms
[2021-05-14 08:06:22] [INFO ] Time to serialize properties into /tmp/LTL7891258773028040472.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/LTL3020856592367560421.gal, -t, CGAL, -LTL, /tmp/LTL7891258773028040472.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/LTL3020856592367560421.gal -t CGAL -LTL /tmp/LTL7891258773028040472.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(arm1_having_swivel_1==1)"))))
Formula 0 simplified : !XF"(arm1_having_swivel_1==1)"
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t80, t85, t89, t99, t107, t111, t118, t132, t137, t141, t148, t160, t164, t173, t177, t181, t186, t190, t194, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :32/131/31/194
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
145 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.47713,72000,1,0,522,166121,382,234,4933,124191,1046
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-1-12 finished in 3323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:23] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:23] [INFO ] Implicit Places using invariants in 90 ms returned [15, 33, 34, 38, 54, 66, 85, 87, 99, 141, 169, 170]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 91 ms to find 12 implicit places.
// Phase 1: matrix 196 rows 184 cols
[2021-05-14 08:06:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:23] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 184/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 5 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2021-05-14 08:06:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:23] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 194 rows 182 cols
[2021-05-14 08:06:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 08:06:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:06:24] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 182/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-1-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, 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}]], initial=1, aps=[p1:(OR (NEQ s156 1) (NEQ s169 1)), p0:(AND (EQ s13 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 18 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-13 finished in 517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2021-05-14 08:06:24] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:24] [INFO ] Implicit Places using invariants in 91 ms returned [15, 33, 38, 54, 66, 85, 87, 99, 141, 169]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 91 ms to find 10 implicit places.
// Phase 1: matrix 196 rows 186 cols
[2021-05-14 08:06:24] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:06:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 186/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 5 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2021-05-14 08:06:24] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:06:24] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2021-05-14 08:06:24] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 08:06:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:06:24] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 184/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s158 1) (EQ s165 1)), p0:(AND (EQ s32 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-14 finished in 519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 196 transition count 169
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 169 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 167 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 58 place count 167 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 155 transition count 155
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 132 place count 130 transition count 130
Applied a total of 132 rules in 12 ms. Remains 130 /196 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 130 cols
[2021-05-14 08:06:24] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-14 08:06:24] [INFO ] Implicit Places using invariants in 81 ms returned [1, 5, 9, 10, 20, 21, 24, 35, 42, 47, 53, 55, 83, 95, 113, 114]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 82 ms to find 16 implicit places.
[2021-05-14 08:06:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 130 rows 114 cols
[2021-05-14 08:06:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 08:06:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 114/196 places, 130/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 111 transition count 127
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 111 transition count 122
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 106 transition count 122
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 76 place count 76 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 75 transition count 91
Applied a total of 78 rules in 7 ms. Remains 75 /114 variables (removed 39) and now considering 91/130 (removed 39) transitions.
// Phase 1: matrix 91 rows 75 cols
[2021-05-14 08:06:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 08:06:24] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 91 rows 75 cols
[2021-05-14 08:06:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 08:06:24] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:06:25] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/196 places, 91/196 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-15 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:(OR (EQ s36 0) (EQ s37 0) (EQ s39 0))], 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 835 reset in 97 ms.
Product exploration explored 100000 steps with 804 reset in 112 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 842 reset in 97 ms.
Product exploration explored 100000 steps with 806 reset in 116 ms.
[2021-05-14 08:06:25] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:06:25] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:06:25] [INFO ] Time to serialize gal into /tmp/LTL12833407479330479216.gal : 1 ms
[2021-05-14 08:06:25] [INFO ] Time to serialize properties into /tmp/LTL4447295631233261015.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/LTL12833407479330479216.gal, -t, CGAL, -LTL, /tmp/LTL4447295631233261015.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/LTL12833407479330479216.gal -t CGAL -LTL /tmp/LTL4447295631233261015.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((arm2_retract_ext==0)||(arm2_forward==0))||(A2U_ext_run==0))"))))
Formula 0 simplified : !GF"(((arm2_retract_ext==0)||(arm2_forward==0))||(A2U_ext_run==0))"
Reverse transition relation is NOT exact ! Due to transitions t85, t83.t82.t89, t105.t104.t111, t175.t168.t48.t49.t54, t88.t87.t64.t36.t37.t42.t65, t110.t109.t66.t2.t14.t62, t147.t146.t160, t163.t162.t117.t0.t10.t118, t94.t107, t140.t139.t119.t115.t18.t22, t21.t20.t26, t33.t32.t30, t57.t56.t50.t51.t16.t34, t131.t124.t137, t172.t171.t177, t189.t188.t169.t167.t181, t193.t192.t190, t45.t44.t38.t39.t166.t186, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :24/49/18/91
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.130998,21592,1,0,130,17690,188,71,2401,12913,211
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-1-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-1-15 finished in 999 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620979586839

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ParamProductionCell-PT-1"
export BK_EXAMINATION="LTLFireability"
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 ParamProductionCell-PT-1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127800373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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