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.r083-tall-162048875400412.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 DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875400412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 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 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-00
FORMULA_NAME DoubleExponent-PT-003-01
FORMULA_NAME DoubleExponent-PT-003-02
FORMULA_NAME DoubleExponent-PT-003-03
FORMULA_NAME DoubleExponent-PT-003-04
FORMULA_NAME DoubleExponent-PT-003-05
FORMULA_NAME DoubleExponent-PT-003-06
FORMULA_NAME DoubleExponent-PT-003-07
FORMULA_NAME DoubleExponent-PT-003-08
FORMULA_NAME DoubleExponent-PT-003-09
FORMULA_NAME DoubleExponent-PT-003-10
FORMULA_NAME DoubleExponent-PT-003-11
FORMULA_NAME DoubleExponent-PT-003-12
FORMULA_NAME DoubleExponent-PT-003-13
FORMULA_NAME DoubleExponent-PT-003-14
FORMULA_NAME DoubleExponent-PT-003-15

=== Now, execution of the tool begins

BK_START 1620584473028

Running Version 0
[2021-05-09 18:21:14] [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-09 18:21:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:21:14] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-09 18:21:14] [INFO ] Transformed 163 places.
[2021-05-09 18:21:14] [INFO ] Transformed 148 transitions.
[2021-05-09 18:21:14] [INFO ] Parsed PT model containing 163 places and 148 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 18:21:14] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-003-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 148
Applied a total of 3 rules in 19 ms. Remains 160 /163 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 160 cols
[2021-05-09 18:21:14] [INFO ] Computed 16 place invariants in 19 ms
[2021-05-09 18:21:15] [INFO ] Implicit Places using invariants in 170 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 202 ms to find 2 implicit places.
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 18:21:15] [INFO ] Computed 14 place invariants in 10 ms
[2021-05-09 18:21:15] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 158/163 places, 148/148 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 18:21:15] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-09 18:21:15] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 158/163 places, 148/148 transitions.
[2021-05-09 18:21:15] [INFO ] Flatten gal took : 44 ms
[2021-05-09 18:21:15] [INFO ] Flatten gal took : 15 ms
[2021-05-09 18:21:15] [INFO ] Input system was already deterministic with 148 transitions.
Incomplete random walk after 100000 steps, including 3336 resets, run finished after 344 ms. (steps per millisecond=290 ) properties (out of 23) seen :4
Running SMT prover for 19 properties.
// Phase 1: matrix 148 rows 158 cols
[2021-05-09 18:21:15] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:15] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using state equation in 39 ms returned unsat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-09 18:21:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-09 18:21:16] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-09 18:21:16] [INFO ] Added : 110 causal constraints over 22 iterations in 400 ms. Result :sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-09 18:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:17] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 18:21:17] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:17] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-09 18:21:17] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:21:17] [INFO ] Added : 97 causal constraints over 20 iterations in 246 ms. Result :sat
[2021-05-09 18:21:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:17] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:17] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-09 18:21:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:17] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:17] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-09 18:21:17] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:21:17] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 7 ms to minimize.
[2021-05-09 18:21:18] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2021-05-09 18:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2021-05-09 18:21:18] [INFO ] Added : 110 causal constraints over 22 iterations in 494 ms. Result :sat
[2021-05-09 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:18] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:18] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2021-05-09 18:21:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:18] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 18:21:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:18] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:18] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-09 18:21:18] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2021-05-09 18:21:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2021-05-09 18:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-09 18:21:18] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-09 18:21:21] [INFO ] Deduced a trap composed of 25 places in 2770 ms of which 1 ms to minimize.
[2021-05-09 18:21:21] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2021-05-09 18:21:21] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2021-05-09 18:21:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2872 ms
[2021-05-09 18:21:21] [INFO ] Added : 136 causal constraints over 28 iterations in 3267 ms. Result :sat
[2021-05-09 18:21:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:21] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:21] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:21:21] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 1 ms to minimize.
[2021-05-09 18:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-09 18:21:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:21] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-09 18:21:21] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2021-05-09 18:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-09 18:21:21] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:21:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2021-05-09 18:21:22] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-09 18:21:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2021-05-09 18:21:22] [INFO ] Added : 142 causal constraints over 29 iterations in 526 ms. Result :sat
[2021-05-09 18:21:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:22] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:22] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2021-05-09 18:21:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:22] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:22] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 18:21:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:22] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 9 ms returned sat
[2021-05-09 18:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:22] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 18:21:22] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2021-05-09 18:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-09 18:21:22] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:21:23] [INFO ] Added : 125 causal constraints over 25 iterations in 299 ms. Result :sat
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:21:23] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:21:23] [INFO ] Added : 138 causal constraints over 28 iterations in 337 ms. Result :sat
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned unsat
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:23] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-09 18:21:23] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:21:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:23] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-09 18:21:23] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:21:24] [INFO ] Added : 105 causal constraints over 21 iterations in 272 ms. Result :sat
[2021-05-09 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:24] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:21:24] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2021-05-09 18:21:24] [INFO ] Deduced a trap composed of 44 places in 25 ms of which 0 ms to minimize.
[2021-05-09 18:21:24] [INFO ] Deduced a trap composed of 37 places in 16 ms of which 0 ms to minimize.
[2021-05-09 18:21:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 98 ms
[2021-05-09 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:24] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-09 18:21:24] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2021-05-09 18:21:24] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2021-05-09 18:21:24] [INFO ] Deduced a trap composed of 44 places in 24 ms of which 0 ms to minimize.
[2021-05-09 18:21:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2021-05-09 18:21:24] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:21:24] [INFO ] Added : 121 causal constraints over 25 iterations in 307 ms. Result :sat
[2021-05-09 18:21:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:24] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:21:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:24] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-09 18:21:24] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:21:25] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2021-05-09 18:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-09 18:21:25] [INFO ] Added : 120 causal constraints over 24 iterations in 368 ms. Result :sat
[2021-05-09 18:21:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:25] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:25] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 18:21:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:21:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:21:25] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:21:25] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-09 18:21:25] [INFO ] Computed and/alt/rep : 147/280/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:21:25] [INFO ] Added : 142 causal constraints over 29 iterations in 375 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
[2021-05-09 18:21:25] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-003-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Graph (complete) has 260 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 157 transition count 112
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 121 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 119 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 119 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 89 place count 113 transition count 104
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 3 with 60 rules applied. Total rules applied 149 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 79 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 79 transition count 74
Applied a total of 158 rules in 39 ms. Remains 79 /158 variables (removed 79) and now considering 74/148 (removed 74) transitions.
// Phase 1: matrix 74 rows 79 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:21:26] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 74 rows 79 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:21:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-09 18:21:26] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2021-05-09 18:21:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 79 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:21:26] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/158 places, 74/148 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s66 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-01 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 156 transition count 147
Applied a total of 3 rules in 15 ms. Remains 156 /158 variables (removed 2) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:26] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-09 18:21:26] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:26] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/158 places, 147/148 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(GT s118 s5), p0:(LEQ s83 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-02 finished in 416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 156 transition count 147
Applied a total of 3 rules in 6 ms. Remains 156 /158 variables (removed 2) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:26] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:26] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:27] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/158 places, 147/148 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-003-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(GT s1 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-05 finished in 351 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 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 156 transition count 147
Applied a total of 3 rules in 6 ms. Remains 156 /158 variables (removed 2) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:27] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:27] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:21:27] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:21:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:21:27] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/158 places, 147/148 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s108)], 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 50000 reset in 369 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 156 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 156 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 33 place count 156 transition count 152
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 156 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 152 transition count 148
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 152 transition count 148
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 79 place count 152 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 151 transition count 153
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 151 transition count 153
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 151 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 144 transition count 167
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 144 transition count 167
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 101 rules in 29 ms. Remains 144 /156 variables (removed 12) and now considering 167/147 (removed -20) transitions.
[2021-05-09 18:21:36] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 167 rows 144 cols
[2021-05-09 18:21:36] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:21:36] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 144/156 places, 167/147 transitions.
Product exploration explored 100000 steps with 50000 reset in 646 ms.
Product exploration explored 100000 steps with 50000 reset in 599 ms.
[2021-05-09 18:21:38] [INFO ] Flatten gal took : 19 ms
[2021-05-09 18:21:38] [INFO ] Flatten gal took : 9 ms
[2021-05-09 18:21:38] [INFO ] Time to serialize gal into /tmp/LTL16214590461988643876.gal : 5 ms
[2021-05-09 18:21:38] [INFO ] Time to serialize properties into /tmp/LTL6357994677256001393.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/LTL16214590461988643876.gal, -t, CGAL, -LTL, /tmp/LTL6357994677256001393.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/LTL16214590461988643876.gal -t CGAL -LTL /tmp/LTL6357994677256001393.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p105<=p55)"))))
Formula 0 simplified : !XF"(p105<=p55)"
Detected timeout of ITS tools.
[2021-05-09 18:21:53] [INFO ] Flatten gal took : 8 ms
[2021-05-09 18:21:53] [INFO ] Applying decomposition
[2021-05-09 18:21:53] [INFO ] Flatten gal took : 19 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/graph6107077219417283922.txt, -o, /tmp/graph6107077219417283922.bin, -w, /tmp/graph6107077219417283922.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/graph6107077219417283922.bin, -l, -1, -v, -w, /tmp/graph6107077219417283922.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:21:53] [INFO ] Decomposing Gal with order
[2021-05-09 18:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:21:53] [INFO ] Removed a total of 43 redundant transitions.
[2021-05-09 18:21:53] [INFO ] Flatten gal took : 53 ms
[2021-05-09 18:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2021-05-09 18:21:53] [INFO ] Time to serialize gal into /tmp/LTL10687269879647309545.gal : 12 ms
[2021-05-09 18:21:53] [INFO ] Time to serialize properties into /tmp/LTL4886411062933362795.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/LTL10687269879647309545.gal, -t, CGAL, -LTL, /tmp/LTL4886411062933362795.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/LTL10687269879647309545.gal -t CGAL -LTL /tmp/LTL4886411062933362795.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu4.p105<=gu4.p55)"))))
Formula 0 simplified : !XF"(gu4.p105<=gu4.p55)"
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gi1.gu51.t115, gi1.gi0.gi5.gu32.t92, gi1.gi0.gi7.gu40.t85, gi1.gi0.gi7.t79, gi1.gi0.gi8.gu35.t72, gi1.gi0.gi8.t66, gi1.gi0.gi10.gu61.t131, gi1.gi0.gi10.t125, gi1.gi0.t56, gi1.gi0.t59, gi1.gi0.t132, gi1.gi0.t135, gi1.gi0.t142, gi1.gi0.t145, gi1.gi1.gi0.gu15.t10, gi1.gi1.gi2.gu17.t26, gi1.gi1.gi2.t20, gi1.gi2.gi0.t32, gi1.gi2.gi1.gu22.t39, gi1.gi2.gi1.gu23.t15, gi1.gi2.gi1.t33, gi1.gi5.gi0.t102, gi1.gi5.gi0.t50, gi1.gi5.gi1.gu53.t118, gi1.gi5.gi1.t112, gi1.t119, gi1.t107, gi1.t106, gi1.t95, gi1.t53, gi1.t43, gi1.t40, gi1.t27, gi1.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/108/34/142
Computing Next relation with stutter on 254172 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1188 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,11.9043,336380,1,0,270,954304,310,147,4369,572628,297
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-003-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DoubleExponent-PT-003-06 finished in 39166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 157 transition count 112
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 122 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 121 transition count 111
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 72 place count 121 transition count 106
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 82 place count 116 transition count 106
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 144 place count 85 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 81 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 80 transition count 74
Applied a total of 153 rules in 20 ms. Remains 80 /158 variables (removed 78) and now considering 74/148 (removed 74) transitions.
// Phase 1: matrix 74 rows 80 cols
[2021-05-09 18:22:06] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:06] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 74 rows 80 cols
[2021-05-09 18:22:06] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:22:06] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2021-05-09 18:22:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 80 cols
[2021-05-09 18:22:06] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/158 places, 74/148 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 3 s57), p0:(LEQ s35 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1790 steps with 225 reset in 16 ms.
FORMULA DoubleExponent-PT-003-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-08 finished in 340 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 148
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 157 cols
[2021-05-09 18:22:06] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-09 18:22:06] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 148 rows 157 cols
[2021-05-09 18:22:06] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:06] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 157 cols
[2021-05-09 18:22:06] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:06] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 157/158 places, 148/148 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s127 s91), p1:(GT s149 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-10 finished in 376 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 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 156 transition count 147
Applied a total of 3 rules in 6 ms. Remains 156 /158 variables (removed 2) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:07] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:07] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/158 places, 147/148 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-11 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:(LEQ 1 s99)], 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 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-11 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 156 transition count 147
Applied a total of 3 rules in 4 ms. Remains 156 /158 variables (removed 2) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:07] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:07] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/158 places, 147/148 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s119)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-12 finished in 355 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 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 157 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 157 transition count 147
Applied a total of 2 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 157 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:07] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 147 rows 157 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:22:07] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 157 cols
[2021-05-09 18:22:07] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:07] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 157/158 places, 147/148 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-13 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:(LEQ 2 s66)], 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 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-13 finished in 324 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 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Graph (complete) has 260 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 156 transition count 108
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 117 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 116 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 81 place count 116 transition count 102
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 91 place count 111 transition count 102
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 3 with 58 rules applied. Total rules applied 149 place count 82 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 155 place count 79 transition count 73
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 79 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 78 transition count 72
Applied a total of 157 rules in 14 ms. Remains 78 /158 variables (removed 80) and now considering 72/148 (removed 76) transitions.
// Phase 1: matrix 72 rows 78 cols
[2021-05-09 18:22:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:08] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 72 rows 78 cols
[2021-05-09 18:22:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:22:08] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2021-05-09 18:22:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 78 cols
[2021-05-09 18:22:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 78/158 places, 72/148 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s19 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-14 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 148/148 transitions.
Graph (complete) has 260 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 156 transition count 110
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 118 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 77 place count 118 transition count 104
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 87 place count 113 transition count 104
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 149 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 77 transition count 72
Applied a total of 158 rules in 14 ms. Remains 77 /158 variables (removed 81) and now considering 72/148 (removed 76) transitions.
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:22:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:08] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:22:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:22:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2021-05-09 18:22:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:22:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 77/158 places, 72/148 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-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:(LEQ s76 s33)], 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 13688 reset in 134 ms.
Product exploration explored 100000 steps with 13779 reset in 142 ms.
Graph (complete) has 232 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13863 reset in 119 ms.
Product exploration explored 100000 steps with 13753 reset in 140 ms.
[2021-05-09 18:22:09] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:22:09] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:22:09] [INFO ] Time to serialize gal into /tmp/LTL13048812124272799132.gal : 1 ms
[2021-05-09 18:22:09] [INFO ] Time to serialize properties into /tmp/LTL1502587231484627994.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/LTL13048812124272799132.gal, -t, CGAL, -LTL, /tmp/LTL1502587231484627994.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/LTL13048812124272799132.gal -t CGAL -LTL /tmp/LTL1502587231484627994.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p99<=p23)"))))
Formula 0 simplified : !GF"(p99<=p23)"
Reverse transition relation is NOT exact ! Due to transitions t2.t3, t41.t15, t42.t43, t50, t53, t56, t59, t61.t92, t94.t95, t102, t106, t107.t147, t126.t137, t135, t142, t145, t4.t5.t6.t7.t8.t9.t16.t20, t18.t19.t10, t25.t27, t28.t11.t13.t29.t33, t31.t32.t14, t38.t40, t117.t119, t130.t132, t139.t140.t141.t62.t66, t1.t12.t23.t34.t45.t55.t62.t66, t58.t75.t79, t143.t144.t75.t79, t47.t48.t49.t108.t112, t96.t97.t98.t99.t100.t101.t108.t112, t51.t52.t121.t125, t103.t105.t121.t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/32/72
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
[2021-05-09 18:22:24] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:22:24] [INFO ] Applying decomposition
[2021-05-09 18:22:24] [INFO ] Flatten gal took : 4 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/graph835112602801685986.txt, -o, /tmp/graph835112602801685986.bin, -w, /tmp/graph835112602801685986.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/graph835112602801685986.bin, -l, -1, -v, -w, /tmp/graph835112602801685986.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:22:24] [INFO ] Decomposing Gal with order
[2021-05-09 18:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:22:24] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-09 18:22:24] [INFO ] Flatten gal took : 21 ms
[2021-05-09 18:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2021-05-09 18:22:24] [INFO ] Time to serialize gal into /tmp/LTL12252340430881910116.gal : 1 ms
[2021-05-09 18:22:24] [INFO ] Time to serialize properties into /tmp/LTL7622826861839144019.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/LTL12252340430881910116.gal, -t, CGAL, -LTL, /tmp/LTL7622826861839144019.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/LTL12252340430881910116.gal -t CGAL -LTL /tmp/LTL7622826861839144019.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu9.p99<=gu9.p23)"))))
Formula 0 simplified : !GF"(gu9.p99<=gu9.p23)"
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.t56, gi1.gi1.t145, gi1.gi1.t139_t140_t141_t62_t66, gi1.gi1.t143_t144_t75_t79, gi1.gi2.gu2.t18.t19.t10, gi1.gi2.gu6.t38.t40, gi1.gi2.t2_t3, gi1.gi2.t41_t15, gi1.gi2.t50, gi1.gi2.t4_t5_t6_t7_t8_t9_t16_t20, gi1.gi2.t25_t27, gi1.gi2.t31_t32_t14, gi1.gi2.t47_t48_t49_t108_t112, gi1.gi4.t94_t95, gi1.gi4.t106, gi1.gi4.t103_t105_t121_t125, gi1.t51_t52_t121_t122, gi1.t96_t97_t98_t99_t100_t101_t108_t109, gi1.t1_t12_t23_t34_t45_t55_t62_t66, gi1.t130_t132, gi1.t117_t119, gi1.t126_t137, gi1.t107_t147, gi1.t102, gi1.t61_t92, gi1.t59, gi1.t53, gi1.t42_t43, t135, t142, t58_t75_t79, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/37/31/68
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13975310699125055404
[2021-05-09 18:22:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13975310699125055404
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/ltsmin13975310699125055404]
Compilation finished in 398 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13975310699125055404]
Link finished in 38 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin13975310699125055404]
LTSmin run took 3913 ms.
FORMULA DoubleExponent-PT-003-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-15 finished in 37585 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620584568000

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r083-tall-162048875400412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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