About the Execution of ITS-Tools for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 685.203 | 237005.00 | 173750.00 | 16161.10 | TFTTFTTTTFTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200622.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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200622
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 697K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 520K 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 Peterson-PT-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1621020813137
Running Version 0
[2021-05-14 19:33:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 19:33:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:33:48] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-05-14 19:33:48] [INFO ] Transformed 480 places.
[2021-05-14 19:33:48] [INFO ] Transformed 690 transitions.
[2021-05-14 19:33:48] [INFO ] Found NUPN structural information;
[2021-05-14 19:33:48] [INFO ] Parsed PT model containing 480 places and 690 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :2
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :3
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2021-05-14 19:33:49] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 19:33:49] [INFO ] Computed 19 place invariants in 25 ms
[2021-05-14 19:33:49] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned unsat
[2021-05-14 19:33:49] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:33:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:49] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-14 19:33:49] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:33:49] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2021-05-14 19:33:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:33:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 19:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:50] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-14 19:33:50] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 19:33:50] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 7 ms to minimize.
[2021-05-14 19:33:50] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2021-05-14 19:33:50] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2021-05-14 19:33:50] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2021-05-14 19:33:50] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2021-05-14 19:33:51] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 0 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:33:52] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 0 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:33:53] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:33:54] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2021-05-14 19:33:54] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2021-05-14 19:33:54] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2021-05-14 19:33:54] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:33:54] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:33:54] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 4 ms to minimize.
[2021-05-14 19:33:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 19:33:55] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:55] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-14 19:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:55] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:55] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 19:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:55] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-14 19:33:55] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 19:33:55] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 0 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2021-05-14 19:33:56] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 0 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 0 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 1 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2021-05-14 19:33:57] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 0 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 0 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 6 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:33:58] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3142 ms
[2021-05-14 19:33:58] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 36 ms.
[2021-05-14 19:34:00] [INFO ] Added : 245 causal constraints over 49 iterations in 1616 ms. Result :unknown
[2021-05-14 19:34:00] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 19:34:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:34:00] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-14 19:34:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:34:04] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-14 19:34:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:34:04] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-14 19:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:34:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:34:04] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:34:05] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-14 19:34:05] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 0 ms to minimize.
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 0 ms to minimize.
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2021-05-14 19:34:05] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2021-05-14 19:34:06] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 0 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:34:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2436 ms
[2021-05-14 19:34:07] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 37 ms.
[2021-05-14 19:34:10] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2021-05-14 19:34:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-14 19:34:10] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:34:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:34:10] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-14 19:34:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:34:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:34:10] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:34:10] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-14 19:34:10] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:34:10] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2021-05-14 19:34:10] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2021-05-14 19:34:10] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 0 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2021-05-14 19:34:11] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Deduced a trap composed of 112 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:34:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2301 ms
[2021-05-14 19:34:12] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2021-05-14 19:34:15] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 0 ms to minimize.
[2021-05-14 19:34:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
FORMULA Peterson-PT-4-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 144900 steps, including 1000 resets, run finished after 430 ms. (steps per millisecond=336 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 25 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 480 transition count 518
Reduce places removed 172 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 181 rules applied. Total rules applied 353 place count 308 transition count 509
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 362 place count 299 transition count 509
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 362 place count 299 transition count 424
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 532 place count 214 transition count 424
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 570 place count 195 transition count 405
Applied a total of 570 rules in 61 ms. Remains 195 /480 variables (removed 285) and now considering 405/690 (removed 285) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/480 places, 405/690 transitions.
[2021-05-14 19:34:22] [INFO ] Flatten gal took : 62 ms
[2021-05-14 19:34:22] [INFO ] Flatten gal took : 25 ms
[2021-05-14 19:34:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11358208742138550179.gal : 15 ms
[2021-05-14 19:34:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality370987826679298939.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11358208742138550179.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality370987826679298939.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11358208742138550179.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality370987826679298939.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality370987826679298939.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 21
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :21 after 24
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :24 after 32
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :32 after 101
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :101 after 210
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :210 after 450
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :450 after 2248
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2248 after 6188
Invariant property Peterson-PT-4-ReachabilityCardinality-15 does not hold.
FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6188 after 14272
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :14272 after 19673
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :19673 after 107690
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :107690 after 241057
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :241057 after 441018
Detected timeout of ITS tools.
[2021-05-14 19:34:37] [INFO ] Flatten gal took : 22 ms
[2021-05-14 19:34:37] [INFO ] Applying decomposition
[2021-05-14 19:34:37] [INFO ] Flatten gal took : 26 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/graph16707798669570811201.txt, -o, /tmp/graph16707798669570811201.bin, -w, /tmp/graph16707798669570811201.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/graph16707798669570811201.bin, -l, -1, -v, -w, /tmp/graph16707798669570811201.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:34:38] [INFO ] Decomposing Gal with order
[2021-05-14 19:34:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:34:38] [INFO ] Removed a total of 358 redundant transitions.
[2021-05-14 19:34:38] [INFO ] Flatten gal took : 77 ms
[2021-05-14 19:34:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 11 ms.
[2021-05-14 19:34:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4106520270199155251.gal : 10 ms
[2021-05-14 19:34:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15429498314726098072.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4106520270199155251.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15429498314726098072.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4106520270199155251.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15429498314726098072.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15429498314726098072.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :20 after 32
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :32 after 114
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :114 after 209
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :209 after 507
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :507 after 2582
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2582 after 6726
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6726 after 19115
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :19115 after 64059
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :64059 after 355951
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :355951 after 632730
Invariant property Peterson-PT-4-ReachabilityCardinality-13 does not hold.
FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2164924954990318987
[2021-05-14 19:34:55] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2164924954990318987
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/ltsmin2164924954990318987]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2164924954990318987] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2164924954990318987] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2598 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 12437316 steps, run timeout after 30001 ms. (steps per millisecond=414 ) properties seen :{1=1}
Probabilistic random walk after 12437316 steps, saw 2073287 distinct states, run finished after 30004 ms. (steps per millisecond=414 ) properties seen :{1=1}
FORMULA Peterson-PT-4-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2021-05-14 19:35:31] [INFO ] Flow matrix only has 345 transitions (discarded 60 similar events)
// Phase 1: matrix 345 rows 195 cols
[2021-05-14 19:35:31] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-14 19:35:31] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-14 19:35:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:35:31] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-14 19:35:31] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:35:31] [INFO ] [Real]Added 132 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:35:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:35:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-14 19:35:31] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:35:31] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:35:31] [INFO ] [Nat]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:35:31] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:35:32] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:35:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:35:34] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:35:34] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:36:16] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2021-05-14 19:36:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 19:36:16] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-14 19:36:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 19:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:36:16] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-14 19:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:36:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned unsat
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 405/405 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 195 transition count 395
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 185 transition count 395
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 20 place count 185 transition count 376
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 58 place count 166 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 165 transition count 375
Applied a total of 60 rules in 31 ms. Remains 165 /195 variables (removed 30) and now considering 375/405 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/195 places, 375/405 transitions.
[2021-05-14 19:36:16] [INFO ] Flatten gal took : 20 ms
[2021-05-14 19:36:16] [INFO ] Flatten gal took : 18 ms
[2021-05-14 19:36:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16592798363775957012.gal : 2 ms
[2021-05-14 19:36:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16776909837744301052.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16592798363775957012.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16776909837744301052.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16592798363775957012.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16776909837744301052.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16776909837744301052.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 115
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :115 after 251
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :251 after 535
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :535 after 2268
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2268 after 4877
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4877 after 12236
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :12236 after 88492
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :88492 after 177839
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :177839 after 411602
Detected timeout of ITS tools.
[2021-05-14 19:36:31] [INFO ] Flatten gal took : 17 ms
[2021-05-14 19:36:31] [INFO ] Applying decomposition
[2021-05-14 19:36:31] [INFO ] Flatten gal took : 17 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/graph9400850874694923257.txt, -o, /tmp/graph9400850874694923257.bin, -w, /tmp/graph9400850874694923257.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/graph9400850874694923257.bin, -l, -1, -v, -w, /tmp/graph9400850874694923257.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:36:31] [INFO ] Decomposing Gal with order
[2021-05-14 19:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:36:31] [INFO ] Removed a total of 398 redundant transitions.
[2021-05-14 19:36:31] [INFO ] Flatten gal took : 38 ms
[2021-05-14 19:36:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 6 ms.
[2021-05-14 19:36:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15050694300389135029.gal : 3 ms
[2021-05-14 19:36:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9987767529602101541.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15050694300389135029.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9987767529602101541.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15050694300389135029.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9987767529602101541.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9987767529602101541.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 38
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :38 after 124
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124 after 215
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :215 after 525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :525 after 1870
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1870 after 8431
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8431 after 12062
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12062 after 80049
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :80049 after 215513
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :215513 after 298857
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :818504 after 924400
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7885547550225535720
[2021-05-14 19:36:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7885547550225535720
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/ltsmin7885547550225535720]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin7885547550225535720] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin7885547550225535720] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2412 ms. (steps per millisecond=414 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13615962 steps, run timeout after 30001 ms. (steps per millisecond=453 ) properties seen :{}
Probabilistic random walk after 13615962 steps, saw 2269776 distinct states, run finished after 30001 ms. (steps per millisecond=453 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-14 19:37:20] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2021-05-14 19:37:20] [INFO ] Computed 19 place invariants in 5 ms
[2021-05-14 19:37:20] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-14 19:37:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:37:20] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:37:20] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:37:20] [INFO ] [Real]Added 132 Read/Feed constraints in 10 ms returned sat
[2021-05-14 19:37:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:37:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-14 19:37:20] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:37:20] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:37:20] [INFO ] [Nat]Added 132 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:37:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:37:21] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 5 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:37:22] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:37:24] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:37:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:37:24] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:37:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:37:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 61 trap constraints in 4955 ms
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.
BK_STOP 1621021050142
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
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 Peterson-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;