Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814800761.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 r066-tajo-158922814800761
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 50K Mar 24 05:37 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 1590134027734

[2020-05-22 07:53:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 07:53:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:53:49] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-22 07:53:49] [INFO ] Transformed 163 places.
[2020-05-22 07:53:49] [INFO ] Transformed 148 transitions.
[2020-05-22 07:53:49] [INFO ] Parsed PT model containing 163 places and 148 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3331 resets, run finished after 223 ms. (steps per millisecond=448 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0]
// Phase 1: matrix 148 rows 163 cols
[2020-05-22 07:53:49] [INFO ] Computed 19 place invariants in 12 ms
[2020-05-22 07:53:50] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned unsat
[2020-05-22 07:53:50] [INFO ] [Real]Absence check using 5 positive place invariants in 28 ms returned sat
[2020-05-22 07:53:50] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 07:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:50] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-22 07:53:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 07:53:50] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 28 ms returned sat
[2020-05-22 07:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:50] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-05-22 07:53:50] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-22 07:53:51] [INFO ] Deduced a trap composed of 37 places in 535 ms
[2020-05-22 07:53:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2020-05-22 07:53:51] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 25 ms.
[2020-05-22 07:53:52] [INFO ] Added : 141 causal constraints over 30 iterations in 811 ms. Result :sat
[2020-05-22 07:53:52] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:53:52] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 07:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:52] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-05-22 07:53:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:53:52] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 07:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:52] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-05-22 07:53:52] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-22 07:53:52] [INFO ] Deduced a trap composed of 37 places in 33 ms
[2020-05-22 07:53:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2020-05-22 07:53:52] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 07:53:53] [INFO ] Added : 141 causal constraints over 30 iterations in 386 ms. Result :sat
[2020-05-22 07:53:53] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:53:53] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:53] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-22 07:53:53] [INFO ] Deduced a trap composed of 74 places in 65 ms
[2020-05-22 07:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2020-05-22 07:53:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 07:53:53] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:53] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-05-22 07:53:53] [INFO ] Deduced a trap composed of 74 places in 60 ms
[2020-05-22 07:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2020-05-22 07:53:53] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 13 ms.
[2020-05-22 07:53:54] [INFO ] Added : 145 causal constraints over 30 iterations in 512 ms. Result :sat
[2020-05-22 07:53:54] [INFO ] Deduced a trap composed of 39 places in 80 ms
[2020-05-22 07:53:54] [INFO ] Deduced a trap composed of 18 places in 54 ms
[2020-05-22 07:53:54] [INFO ] Deduced a trap composed of 37 places in 68 ms
[2020-05-22 07:53:54] [INFO ] Deduced a trap composed of 25 places in 70 ms
[2020-05-22 07:53:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 367 ms
[2020-05-22 07:53:54] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-05-22 07:53:54] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:53:54] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:54] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-22 07:53:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:53:54] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 07:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:54] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2020-05-22 07:53:54] [INFO ] Deduced a trap composed of 18 places in 64 ms
[2020-05-22 07:53:54] [INFO ] Deduced a trap composed of 56 places in 68 ms
[2020-05-22 07:53:55] [INFO ] Deduced a trap composed of 85 places in 60 ms
[2020-05-22 07:53:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2020-05-22 07:53:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 13 ms.
[2020-05-22 07:53:55] [INFO ] Added : 147 causal constraints over 30 iterations in 447 ms. Result :sat
[2020-05-22 07:53:55] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 07:53:55] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2020-05-22 07:53:55] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:53:55] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:55] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-05-22 07:53:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 07:53:55] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:55] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-22 07:53:55] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2020-05-22 07:53:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2020-05-22 07:53:56] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2020-05-22 07:53:56] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 07:53:56] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:56] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-05-22 07:53:56] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-05-22 07:53:56] [INFO ] Deduced a trap composed of 48 places in 38 ms
[2020-05-22 07:53:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2020-05-22 07:53:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:53:56] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:56] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2020-05-22 07:53:56] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-05-22 07:53:56] [INFO ] Deduced a trap composed of 48 places in 33 ms
[2020-05-22 07:53:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2020-05-22 07:53:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-05-22 07:53:57] [INFO ] Added : 145 causal constraints over 29 iterations in 443 ms. Result :sat
[2020-05-22 07:53:57] [INFO ] Deduced a trap composed of 56 places in 38 ms
[2020-05-22 07:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-05-22 07:53:57] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-22 07:53:57] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 07:53:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-22 07:53:57] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:53:57] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:57] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-05-22 07:53:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:53:57] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:57] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2020-05-22 07:53:57] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-05-22 07:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-05-22 07:53:57] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 07:53:58] [INFO ] Added : 144 causal constraints over 29 iterations in 390 ms. Result :sat
[2020-05-22 07:53:58] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:53:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:58] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 67 places in 43 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 62 places in 45 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 56 places in 49 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-05-22 07:53:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 263 ms
[2020-05-22 07:53:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:53:58] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 07:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:58] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 67 places in 41 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 56 places in 52 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-05-22 07:53:58] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2020-05-22 07:53:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 280 ms
[2020-05-22 07:53:58] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 07:53:59] [INFO ] Added : 93 causal constraints over 19 iterations in 283 ms. Result :sat
[2020-05-22 07:53:59] [INFO ] Deduced a trap composed of 73 places in 77 ms
[2020-05-22 07:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-05-22 07:53:59] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:53:59] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 07:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:59] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-05-22 07:53:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:53:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-05-22 07:53:59] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 07:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:53:59] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-05-22 07:53:59] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-05-22 07:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-05-22 07:53:59] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 07:54:00] [INFO ] Added : 144 causal constraints over 29 iterations in 403 ms. Result :sat
[2020-05-22 07:54:00] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:54:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:00] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-22 07:54:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:54:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 07:54:00] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:00] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-22 07:54:00] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-22 07:54:00] [INFO ] Deduced a trap composed of 53 places in 82 ms
[2020-05-22 07:54:00] [INFO ] Deduced a trap composed of 43 places in 28 ms
[2020-05-22 07:54:00] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-05-22 07:54:00] [INFO ] Deduced a trap composed of 42 places in 21 ms
[2020-05-22 07:54:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 309 ms
[2020-05-22 07:54:00] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 07:54:01] [INFO ] Added : 141 causal constraints over 29 iterations in 342 ms. Result :sat
[2020-05-22 07:54:01] [INFO ] Deduced a trap composed of 40 places in 60 ms
[2020-05-22 07:54:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2020-05-22 07:54:01] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2020-05-22 07:54:01] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:54:01] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 07:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:01] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-22 07:54:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:54:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 07:54:01] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:01] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-05-22 07:54:01] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2020-05-22 07:54:01] [INFO ] Deduced a trap composed of 47 places in 78 ms
[2020-05-22 07:54:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2020-05-22 07:54:01] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 07:54:02] [INFO ] Added : 100 causal constraints over 20 iterations in 303 ms. Result :sat
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 07:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-22 07:54:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:54:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-05-22 07:54:02] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 07:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:02] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2020-05-22 07:54:02] [INFO ] Deduced a trap composed of 53 places in 62 ms
[2020-05-22 07:54:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-05-22 07:54:02] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 07:54:02] [INFO ] Added : 38 causal constraints over 8 iterations in 198 ms. Result :sat
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:02] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 40 places in 52 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 46 places in 76 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 42 places in 75 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 48 places in 58 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 73 places in 116 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 73 places in 72 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 66 places in 68 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 85 places in 51 ms
[2020-05-22 07:54:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 742 ms
[2020-05-22 07:54:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:54:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-05-22 07:54:03] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 07:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:54:03] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 40 places in 61 ms
[2020-05-22 07:54:03] [INFO ] Deduced a trap composed of 46 places in 74 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 18 places in 78 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 53 places in 71 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 71 places in 53 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 73 places in 60 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 85 places in 63 ms
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 48 places in 39 ms
[2020-05-22 07:54:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 642 ms
[2020-05-22 07:54:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 07:54:04] [INFO ] Added : 140 causal constraints over 28 iterations in 294 ms. Result :sat
[2020-05-22 07:54:04] [INFO ] Deduced a trap composed of 76 places in 83 ms
[2020-05-22 07:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-05-22 07:54:05] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 07:54:05] [INFO ] Flatten gal took : 63 ms
FORMULA DoubleExponent-PT-003-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:54:05] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 07:54:05] [INFO ] Applying decomposition
[2020-05-22 07:54:05] [INFO ] Flatten gal took : 31 ms
[2020-05-22 07:54:05] [INFO ] Input system was already deterministic with 148 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph1919681251152471524.txt, -o, /tmp/graph1919681251152471524.bin, -w, /tmp/graph1919681251152471524.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 148 rows 163 cols
[2020-05-22 07:54:05] [INFO ] Computed 19 place invariants in 4 ms
inv : p36 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : p1 + p100 + p101 + p102 + p103 + p105 + p106 + p107 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p123 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p149 + p15 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p158 + p16 + p160 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 1
inv : p122 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p137 + p148 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p158 - p160 + p69 + p71 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : 3*p1 + p100 + p101 + p102 + p103 + p105 + p107 + p114 + p115 + p116 + p117 + p118 + p119 + p12 + p120 + p121 + p123 + p125 + p126 + p127 + p128 + p129 + p13 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p149 + p15 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p158 + p16 + p160 + p17 + p18 + p19 + 3*p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + 3*p3 + p30 + p31 + p32 + p33 + p35 + p37 + p38 + p39 + 2*p4 + p40 + p41 + p42 + p43 + p44 + p45 + p47 + p49 + 2*p5 + p50 + 2*p51 + p52 + 2*p53 + p54 + 2*p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 3
inv : 2*p1 + p10 + p100 + p11 + p17 + 2*p2 + p29 + p3 + p32 + p4 + p5 = 2
inv : p159 + p71 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : -p106 - p24 - p36 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p49 + p50 + p51 + p52 + p53 + p54 = 0
inv : -p102 + p153 - p20 + p56 - p57 + p59 - p60 + p64 + p76 + p79 + p81 + p93 = 0
inv : -p102 + p151 - p19 - p20 + p55 - p57 + p58 - p60 + p62 + p81 + p88 + p91 + p93 = 0
inv : p124 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 = 0
inv : p136 + p148 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p158 - p160 + p69 + p71 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 - p83 - p95 + p97 + p98 + p99 = 0
inv : p108 - p110 + p111 - p113 + p115 + p134 + p141 + p144 + p146 - p155 - p66 - p67 = 0
inv : p109 - p110 + p112 - p113 + p117 + p129 + p132 + p134 + p146 - p155 - p67 = 0
inv : p1 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p123 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p149 + p15 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p158 + p16 + p160 + p17 + p18 + p19 + p2 + p20 + p21 + p22 + p23 + p24 + p25 + p3 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : -p120 + p162 - p163 = 0
inv : -p119 - p120 + p161 - p163 = 0
inv : 2*p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 + p98 = 2
inv : p157 + p69 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 = 0
Total of 19 invariants.
[2020-05-22 07:54:05] [INFO ] Computed 19 place invariants in 7 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1919681251152471524.bin, -l, -1, -v, -w, /tmp/graph1919681251152471524.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:54:05] [INFO ] Decomposing Gal with order
[2020-05-22 07:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:54:05] [INFO ] Removed a total of 49 redundant transitions.
[2020-05-22 07:54:05] [INFO ] Flatten gal took : 67 ms
[2020-05-22 07:54:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2020-05-22 07:54:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-22 07:54:05] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((G(F("(gi6.gi1.gi1.gu10.p12<1)"))))
Formula 0 simplified : !GF"(gi6.gi1.gi1.gu10.p12<1)"
[2020-05-22 07:54:05] [INFO ] Proved 163 variables to be positive in 393 ms
[2020-05-22 07:54:05] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2020-05-22 07:54:05] [INFO ] Computation of disable matrix completed :0/148 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:54:05] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:54:05] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2020-05-22 07:54:05] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:54:07] [INFO ] Computing symmetric co enabling matrix : 148 transitions.
[2020-05-22 07:54:08] [INFO ] Computation of co-enabling matrix(4/148) took 1380 ms. Total solver calls (SAT/UNSAT): 725(64/661)
[2020-05-22 07:54:12] [INFO ] Computation of co-enabling matrix(21/148) took 4700 ms. Total solver calls (SAT/UNSAT): 3003(337/2666)
[2020-05-22 07:54:15] [INFO ] Computation of co-enabling matrix(34/148) took 7704 ms. Total solver calls (SAT/UNSAT): 4550(547/4003)
[2020-05-22 07:54:18] [INFO ] Computation of co-enabling matrix(42/148) took 10751 ms. Total solver calls (SAT/UNSAT): 5418(676/4742)
[2020-05-22 07:54:21] [INFO ] Computation of co-enabling matrix(56/148) took 13836 ms. Total solver calls (SAT/UNSAT): 6783(901/5882)
[2020-05-22 07:54:24] [INFO ] Computation of co-enabling matrix(73/148) took 16963 ms. Total solver calls (SAT/UNSAT): 8177(1112/7065)
[2020-05-22 07:54:27] [INFO ] Computation of co-enabling matrix(81/148) took 20273 ms. Total solver calls (SAT/UNSAT): 8733(1595/7138)
[2020-05-22 07:54:31] [INFO ] Computation of co-enabling matrix(89/148) took 23721 ms. Total solver calls (SAT/UNSAT): 9225(2019/7206)
[2020-05-22 07:54:34] [INFO ] Computation of co-enabling matrix(130/148) took 26737 ms. Total solver calls (SAT/UNSAT): 10742(2130/8612)
[2020-05-22 07:54:34] [INFO ] Computation of Finished co-enabling matrix. took 27425 ms. Total solver calls (SAT/UNSAT): 10878(2131/8747)
[2020-05-22 07:54:34] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2020-05-22 07:54:35] [INFO ] Computation of Completed DNA matrix. took 151 ms. Total solver calls (SAT/UNSAT): 42(0/42)
[2020-05-22 07:54:35] [INFO ] Built C files in 29933ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 1880 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 76 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAP0==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAP0==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAP0==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions gu35.t49, gi0.gu37.t25, gi0.t30, gi1.t147, gi1.t135, gi2.gu15.t122, gi2.t117, gi2.t108, gi3.gu18.t129, gi6.gi1.gi0.gu42.t42, gi6.gi1.gi0.t37, gi6.gi2.gi0.gu53.t7, gi6.gi2.gi0.t19, gi6.gi2.t9, gi6.gi3.gi1.t138, gi6.gi3.gi3.gu66.t84, gi6.gi3.gi3.t79, gi6.gi3.t51, gi6.gi4.gu7.t99, gi6.t97, gi6.t88, gi6.t85, gi6.t58, gi8.gu58.t72, gi8.t67, t101, t111, t123, t134, t144, t16, t61, t73, t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/112/34/146
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
[2020-05-22 08:14:11] [INFO ] Flatten gal took : 21 ms
[2020-05-22 08:14:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-22 08:14:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((G(F("(p12<1)"))))
Formula 0 simplified : !GF"(p12<1)"
Reverse transition relation is NOT exact ! Due to transitions t101, t108, t111, t117, t122, t123, t129, t134, t135, t138, t144, t147, t16, t19, t25, t30, t37, t42, t49, t51, t58, t61, t67, t7, t72, t73, t79, t84, t85, t88, t9, t94, t97, t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/114/34/148
Computing Next relation with stutter on 254172 deadlock states
18130 unique states visited
18130 strongly connected components in search stack
18131 transitions explored
18130 items max in DFS search stack
20338 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,203.409,2420476,1,0,49047,1.37312e+07,22,38308,2715,1.68156e+07,38385
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(!(F("(p37<=p141)"))))))
Formula 1 simplified : !FG!F"(p37<=p141)"
Computing Next relation with stutter on 254172 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24873 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,452.168,3265572,1,0,68921,1.75665e+07,20,52302,2612,2.68457e+07,61869
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((F("(p8>=2)"))U((G((X("(p8>=2)"))||("(p8>=2)")))&&(X("(p41<=p75)"))))))
Formula 2 simplified : !X(F"(p8>=2)" U (G("(p8>=2)" | X"(p8>=2)") & X"(p41<=p75)"))
Computing Next relation with stutter on 254172 deadlock states
96 unique states visited
95 strongly connected components in search stack
96 transitions explored
95 items max in DFS search stack
2452 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,476.685,3266692,1,0,68921,1.75665e+07,36,52302,3959,2.68457e+07,62908
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(X("((p35>=1)||(p78>p57))"))))
Formula 3 simplified : !FX"((p35>=1)||(p78>p57))"
Computing Next relation with stutter on 254172 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 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,476.787,3266692,1,0,68921,1.75665e+07,45,52302,3966,2.68457e+07,63225
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F((!(("(p4>=1)")U("(p160<=p146)")))U(F("(p59>=3)")))))
Formula 4 simplified : !F(!("(p4>=1)" U "(p160<=p146)") U F"(p59>=3)")
Computing Next relation with stutter on 254172 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
58 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,477.375,3266692,1,0,68921,1.75665e+07,54,52302,3968,2.68457e+07,65063
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G("(p144<=p139)")))
Formula 5 simplified : !G"(p144<=p139)"
Computing Next relation with stutter on 254172 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8713 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,564.499,3590136,1,0,68921,1.92835e+07,22,52302,3450,2.70812e+07,58573
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(!(X(G(F(X(F(("(p142<=p157)")U("(p34<=p37)"))))))))))
Formula 6 simplified : !F!XGFXF("(p142<=p157)" U "(p34<=p37)")
Computing Next relation with stutter on 254172 deadlock states
18129 unique states visited
18128 strongly connected components in search stack
18130 transitions explored
18129 items max in DFS search stack
14163 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,706.17,3946988,1,0,69939,1.92835e+07,18,73691,2815,3.19716e+07,31961
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((!((G("(p75<=p37)"))U(F(G("(p30>p25)")))))||(G("(p81>p35)"))))
Formula 7 simplified : !(!(G"(p75<=p37)" U FG"(p30>p25)") | G"(p81>p35)")
Computing Next relation with stutter on 254172 deadlock states
28097 unique states visited
0 strongly connected components in search stack
36208 transitions explored
18128 items max in DFS search stack
5150 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,757.817,3947284,1,0,69939,1.92835e+07,37,73691,3964,3.19716e+07,214816
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-003-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(!(("(p6<=p127)")U(F("(p26<=p67)"))))))
Formula 8 simplified : !X!("(p6<=p127)" U F"(p26<=p67)")
Computing Next relation with stutter on 254172 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
17 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,758.058,3947356,1,0,69939,1.92835e+07,45,73691,3968,3.19716e+07,214829
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DoubleExponent-PT-003-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1590136037868

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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"

# 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 r066-tajo-158922814800761"
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 ;