About the Execution of ITS-Tools for PaceMaker-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10300.195 | 680869.00 | 696580.00 | 19495.80 | FFFTTTFFFFTTTFFT | 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-162089127700358.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 PaceMaker-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127700358
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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 5.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 158K 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 PaceMaker-PT-none-ReachabilityCardinality-00
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-01
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-02
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-03
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-04
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-05
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-06
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-07
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-08
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-09
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-10
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-11
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-12
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-13
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-14
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620978811847
Running Version 0
[2021-05-14 07:53:46] [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 07:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 07:53:46] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-14 07:53:46] [INFO ] Transformed 70 places.
[2021-05-14 07:53:46] [INFO ] Transformed 164 transitions.
[2021-05-14 07:53:46] [INFO ] Parsed PT model containing 70 places and 164 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :2
FORMULA PaceMaker-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PaceMaker-PT-none-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) 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 14) seen :1
FORMULA PaceMaker-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :1
FORMULA PaceMaker-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2021-05-14 07:53:47] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2021-05-14 07:53:47] [INFO ] Computed 35 place invariants in 12 ms
[2021-05-14 07:53:47] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2021-05-14 07:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:47] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-14 07:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:53:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:47] [INFO ] [Nat]Absence check using state equation in 359 ms returned unsat
[2021-05-14 07:53:47] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 07:53:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:53:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:50] [INFO ] [Nat]Absence check using state equation in 2959 ms returned sat
[2021-05-14 07:53:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 07:53:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 07:53:52] [INFO ] [Nat]Added 58 Read/Feed constraints in 2022 ms returned unknown
[2021-05-14 07:53:52] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-14 07:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:52] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 07:53:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:53:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:53] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2021-05-14 07:53:53] [INFO ] [Nat]Added 58 Read/Feed constraints in 22 ms returned sat
[2021-05-14 07:53:53] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 3 ms to minimize.
[2021-05-14 07:53:53] [INFO ] Deduced a trap composed of 1 places in 11 ms of which 4 ms to minimize.
[2021-05-14 07:53:53] [INFO ] Deduced a trap composed of 1 places in 12 ms of which 0 ms to minimize.
[2021-05-14 07:53:53] [INFO ] Deduced a trap composed of 1 places in 13 ms of which 5 ms to minimize.
[2021-05-14 07:53:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 145 ms
[2021-05-14 07:53:53] [INFO ] Computed and/alt/rep : 121/512/120 causal constraints (skipped 27 transitions) in 24 ms.
[2021-05-14 07:53:54] [INFO ] Deduced a trap composed of 2 places in 7 ms of which 1 ms to minimize.
[2021-05-14 07:53:54] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 1 ms to minimize.
[2021-05-14 07:53:54] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 1 ms to minimize.
[2021-05-14 07:53:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 89 ms
[2021-05-14 07:53:54] [INFO ] Added : 98 causal constraints over 21 iterations in 869 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-14 07:53:54] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:54] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 07:53:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:53:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2021-05-14 07:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:59] [INFO ] [Nat]Absence check using state equation in 4974 ms returned unknown
[2021-05-14 07:53:59] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:53:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 07:53:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:53:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:04] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2021-05-14 07:54:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:04] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 07:54:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:54:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:08] [INFO ] [Nat]Absence check using state equation in 3754 ms returned sat
[2021-05-14 07:54:08] [INFO ] [Nat]Added 58 Read/Feed constraints in 90 ms returned sat
[2021-05-14 07:54:08] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 0 ms to minimize.
[2021-05-14 07:54:09] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 0 ms to minimize.
[2021-05-14 07:54:09] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
[2021-05-14 07:54:09] [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
[2021-05-14 07:54:10] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 07:54:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:54:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:13] [INFO ] [Nat]Absence check using state equation in 3759 ms returned sat
[2021-05-14 07:54:13] [INFO ] [Nat]Added 58 Read/Feed constraints in 89 ms returned sat
[2021-05-14 07:54:13] [INFO ] Deduced a trap composed of 1 places in 12 ms of which 0 ms to minimize.
[2021-05-14 07:54:15] [INFO ] Deduced a trap composed of 1 places in 12 ms of which 0 ms to minimize.
[2021-05-14 07:54:15] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2021-05-14 07:54: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 7
[2021-05-14 07:54:15] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:15] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 07:54:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:54:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-14 07:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:18] [INFO ] [Nat]Absence check using state equation in 3463 ms returned sat
[2021-05-14 07:54:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 07:54:20] [INFO ] [Nat]Added 58 Read/Feed constraints in 1522 ms returned unknown
[2021-05-14 07:54:20] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 07:54:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:54:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:23] [INFO ] [Nat]Absence check using state equation in 3323 ms returned unsat
[2021-05-14 07:54:23] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned unsat
[2021-05-14 07:54:23] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:23] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 07:54:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:54:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-14 07:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:54:23] [INFO ] [Nat]Absence check using state equation in 199 ms returned unsat
FORMULA PaceMaker-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Interrupted Parikh walk after 8854081 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=295 ) properties (out of 7) seen :0
Support contains 24 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 164/164 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 162
Applied a total of 6 rules in 26 ms. Remains 66 /70 variables (removed 4) and now considering 162/164 (removed 2) transitions.
[2021-05-14 07:54:53] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 07:54:53] [INFO ] Computed 33 place invariants in 5 ms
[2021-05-14 07:54:53] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/70 places, 162/164 transitions.
[2021-05-14 07:54:54] [INFO ] Flatten gal took : 45 ms
[2021-05-14 07:54:54] [INFO ] Flatten gal took : 16 ms
[2021-05-14 07:54:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9334992312500078783.gal : 9 ms
[2021-05-14 07:54:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7962246174134549208.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/ReachabilityCardinality9334992312500078783.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7962246174134549208.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/ReachabilityCardinality9334992312500078783.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7962246174134549208.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7962246174134549208.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :30 after 192
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :192 after 434
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :434 after 2124
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :2124 after 9252
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :9252 after 33896
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :33896 after 1.37871e+07
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.37871e+07 after 2.81389e+09
Detected timeout of ITS tools.
[2021-05-14 07:55:09] [INFO ] Flatten gal took : 12 ms
[2021-05-14 07:55:09] [INFO ] Applying decomposition
[2021-05-14 07:55:09] [INFO ] Flatten gal took : 12 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/graph7636475588306731792.txt, -o, /tmp/graph7636475588306731792.bin, -w, /tmp/graph7636475588306731792.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/graph7636475588306731792.bin, -l, -1, -v, -w, /tmp/graph7636475588306731792.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 07:55:18] [INFO ] Decomposing Gal with order
[2021-05-14 07:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 07:55:18] [INFO ] Removed a total of 110 redundant transitions.
[2021-05-14 07:55:18] [INFO ] Flatten gal took : 54 ms
[2021-05-14 07:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 7 ms.
[2021-05-14 07:55:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9654468544708091170.gal : 5 ms
[2021-05-14 07:55:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality71938752306864630.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/ReachabilityCardinality9654468544708091170.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality71938752306864630.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/ReachabilityCardinality9654468544708091170.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality71938752306864630.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality71938752306864630.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 40
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :40 after 288
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :288 after 7632
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :7632 after 35856
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :35856 after 7.09862e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2936444654000051132
[2021-05-14 07:55:33] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2936444654000051132
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/ltsmin2936444654000051132]
Compilation finished in 849 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2936444654000051132]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, PaceMakerPTnoneReachabilityCardinality01==true], workingDir=/tmp/ltsmin2936444654000051132]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3997 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1263 ms. (steps per millisecond=791 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 10524019 steps, run timeout after 30001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 10524019 steps, saw 6967014 distinct states, run finished after 30004 ms. (steps per millisecond=350 ) properties seen :{}
Running SMT prover for 7 properties.
[2021-05-14 07:56:30] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 07:56:30] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-14 07:56:30] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-14 07:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:30] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 07:56:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:56:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:34] [INFO ] [Nat]Absence check using state equation in 3475 ms returned sat
[2021-05-14 07:56:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 07:56:34] [INFO ] [Nat]Added 58 Read/Feed constraints in 21 ms returned sat
[2021-05-14 07:56:34] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 0 ms to minimize.
[2021-05-14 07:56:34] [INFO ] Deduced a trap composed of 1 places in 14 ms of which 1 ms to minimize.
[2021-05-14 07:56:34] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 1 ms to minimize.
[2021-05-14 07:56:37] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 07:56:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3401 ms
[2021-05-14 07:56:37] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 16 ms.
[2021-05-14 07:56:39] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 1 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2021-05-14 07:56:40] [INFO ] Added : 93 causal constraints over 19 iterations in 2654 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-14 07:56:40] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2021-05-14 07:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:40] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 07:56:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:56:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:40] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-14 07:56:40] [INFO ] [Nat]Added 58 Read/Feed constraints in 33 ms returned sat
[2021-05-14 07:56:40] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 1 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 1 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 1 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 07:56:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 100 ms
[2021-05-14 07:56:40] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 9 ms.
[2021-05-14 07:56:47] [INFO ] Added : 45 causal constraints over 9 iterations in 6101 ms. Result :unknown
[2021-05-14 07:56:47] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:47] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 07:56:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:56:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:53] [INFO ] [Nat]Absence check using state equation in 6138 ms returned unknown
[2021-05-14 07:56:57] [INFO ] [Real]Absence check using 33 positive place invariants in 4358 ms returned sat
[2021-05-14 07:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 07:56:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:56:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2021-05-14 07:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:56:58] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2021-05-14 07:56:58] [INFO ] [Nat]Added 58 Read/Feed constraints in 20 ms returned sat
[2021-05-14 07:56:58] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 0 ms to minimize.
[2021-05-14 07:56:58] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 0 ms to minimize.
[2021-05-14 07:56:58] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 07:56:58] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 0 ms to minimize.
[2021-05-14 07:56:58] [INFO ] Deduced a trap composed of 2 places in 7 ms of which 1 ms to minimize.
[2021-05-14 07:56:58] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 07:56:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 393 ms
[2021-05-14 07:56:58] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 10 ms.
[2021-05-14 07:57:05] [INFO ] Added : 70 causal constraints over 14 iterations in 6222 ms. Result :unknown
[2021-05-14 07:57:05] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:57:05] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 07:57:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:57:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2021-05-14 07:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:57:12] [INFO ] [Nat]Absence check using state equation in 7439 ms returned unknown
[2021-05-14 07:57:12] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:57:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 07:57:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:57:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:57:13] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2021-05-14 07:57:13] [INFO ] [Nat]Added 58 Read/Feed constraints in 25 ms returned sat
[2021-05-14 07:57:13] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 1 ms to minimize.
[2021-05-14 07:57:57] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 0 ms to minimize.
[2021-05-14 07:57:57] [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 07:57:57] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 07:57:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-14 07:57:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 07:57:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 07:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 07:58:03] [INFO ] [Nat]Absence check using state equation in 5635 ms returned sat
[2021-05-14 07:58:03] [INFO ] [Nat]Added 58 Read/Feed constraints in 71 ms returned sat
[2021-05-14 07:58:03] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 0 ms to minimize.
[2021-05-14 07:58:03] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 1 ms to minimize.
[2021-05-14 07:58:04] [INFO ] Deduced a trap composed of 1 places in 12 ms of which 0 ms to minimize.
[2021-05-14 07:58:06] [INFO ] Deduced a trap composed of 1 places in 9 ms of which 1 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 35 ms of which 0 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 1 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 11 ms of which 5 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 1 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 1 ms to minimize.
[2021-05-14 07:58:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 6075 ms
FORMULA PaceMaker-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 3021400 steps, including 1000 resets, run finished after 10508 ms. (steps per millisecond=287 ) properties (out of 6) seen :0 could not realise parikh vector
Interrupted Parikh walk after 8123488 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Parikh walk after 1759000 steps, including 1000 resets, run finished after 6358 ms. (steps per millisecond=276 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 20 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 162/162 transitions.
[2021-05-14 07:58:56] [INFO ] Flatten gal took : 10 ms
[2021-05-14 07:58:56] [INFO ] Flatten gal took : 10 ms
[2021-05-14 07:58:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12271309245750025023.gal : 2 ms
[2021-05-14 07:58:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14601316097192934161.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/ReachabilityCardinality12271309245750025023.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14601316097192934161.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/ReachabilityCardinality12271309245750025023.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14601316097192934161.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14601316097192934161.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :30 after 192
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :192 after 434
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :434 after 2124
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2124 after 9252
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :9252 after 33896
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :33896 after 1.37871e+07
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.37871e+07 after 2.81389e+09
Detected timeout of ITS tools.
[2021-05-14 07:59:11] [INFO ] Flatten gal took : 9 ms
[2021-05-14 07:59:11] [INFO ] Applying decomposition
[2021-05-14 07:59:11] [INFO ] Flatten gal took : 9 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/graph17924743987255048198.txt, -o, /tmp/graph17924743987255048198.bin, -w, /tmp/graph17924743987255048198.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/graph17924743987255048198.bin, -l, -1, -v, -w, /tmp/graph17924743987255048198.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 07:59:11] [INFO ] Decomposing Gal with order
[2021-05-14 07:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 07:59:11] [INFO ] Removed a total of 112 redundant transitions.
[2021-05-14 07:59:11] [INFO ] Flatten gal took : 20 ms
[2021-05-14 07:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2021-05-14 07:59:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1378752593367926136.gal : 3 ms
[2021-05-14 07:59:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8838416628433244227.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/ReachabilityCardinality1378752593367926136.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8838416628433244227.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/ReachabilityCardinality1378752593367926136.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8838416628433244227.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8838416628433244227.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 62
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :62 after 3552
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :3552 after 95104
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :95104 after 1.75735e+08
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.75735e+08 after 4.87915e+11
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4.87915e+11 after 6.24775e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin566149054091102067
[2021-05-14 07:59:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin566149054091102067
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/ltsmin566149054091102067]
Compilation finished in 733 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin566149054091102067]
Link finished in 32 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, PaceMakerPTnoneReachabilityCardinality01==true], workingDir=/tmp/ltsmin566149054091102067]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4015 ms. (steps per millisecond=249 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 10516965 steps, run timeout after 30001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 10516965 steps, saw 6962806 distinct states, run finished after 30001 ms. (steps per millisecond=350 ) properties seen :{}
Running SMT prover for 6 properties.
[2021-05-14 08:00:22] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 08:00:22] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-14 08:00:22] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:22] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 08:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:00:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:25] [INFO ] [Nat]Absence check using state equation in 3481 ms returned sat
[2021-05-14 08:00:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:00:25] [INFO ] [Nat]Added 58 Read/Feed constraints in 21 ms returned sat
[2021-05-14 08:00:25] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 0 ms to minimize.
[2021-05-14 08:00:25] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:26] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:29] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 1 ms to minimize.
[2021-05-14 08:00:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3391 ms
[2021-05-14 08:00:29] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 10 ms.
[2021-05-14 08:00:31] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:31] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 3 ms to minimize.
[2021-05-14 08:00:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2021-05-14 08:00:31] [INFO ] Added : 93 causal constraints over 19 iterations in 2650 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 08:00:31] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:00:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:32] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-14 08:00:32] [INFO ] [Nat]Added 58 Read/Feed constraints in 34 ms returned sat
[2021-05-14 08:00:32] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 0 ms to minimize.
[2021-05-14 08:00:32] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:32] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 0 ms to minimize.
[2021-05-14 08:00:32] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 0 ms to minimize.
[2021-05-14 08:00:32] [INFO ] Deduced a trap composed of 1 places in 4 ms of which 0 ms to minimize.
[2021-05-14 08:00:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 93 ms
[2021-05-14 08:00:32] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 9 ms.
[2021-05-14 08:00:38] [INFO ] Added : 45 causal constraints over 9 iterations in 6098 ms. Result :unknown
[2021-05-14 08:00:38] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 08:00:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:00:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:44] [INFO ] [Nat]Absence check using state equation in 6139 ms returned unknown
[2021-05-14 08:00:45] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:00:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:00:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:45] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2021-05-14 08:00:45] [INFO ] [Nat]Added 58 Read/Feed constraints in 20 ms returned sat
[2021-05-14 08:00:46] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 0 ms to minimize.
[2021-05-14 08:00:46] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 0 ms to minimize.
[2021-05-14 08:00:46] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:46] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:46] [INFO ] Deduced a trap composed of 2 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:00:46] [INFO ] Deduced a trap composed of 1 places in 9 ms of which 4 ms to minimize.
[2021-05-14 08:00:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 345 ms
[2021-05-14 08:00:46] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 7 ms.
[2021-05-14 08:00:50] [INFO ] Added : 70 causal constraints over 14 iterations in 3735 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 08:00:50] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:00:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:00:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:57] [INFO ] [Nat]Absence check using state equation in 7441 ms returned unknown
[2021-05-14 08:00:57] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:00:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:00:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:00:58] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2021-05-14 08:00:58] [INFO ] [Nat]Added 58 Read/Feed constraints in 26 ms returned sat
[2021-05-14 08:00:58] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 0 ms to minimize.
[2021-05-14 08:01:42] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 0 ms to minimize.
[2021-05-14 08:01:42] [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
Fused 6 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 3021400 steps, including 1000 resets, run finished after 10399 ms. (steps per millisecond=290 ) properties (out of 6) seen :0 could not realise parikh vector
Interrupted Parikh walk after 8155749 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=271 ) properties (out of 6) seen :0
Incomplete Parikh walk after 3241000 steps, including 1000 resets, run finished after 10544 ms. (steps per millisecond=307 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 20 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 162/162 transitions.
Starting structural reductions, iteration 0 : 66/66 places, 162/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2021-05-14 08:02:33] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 08:02:33] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-14 08:02:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-14 08:02:33] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 08:02:33] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-14 08:02:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:02:33] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2021-05-14 08:02:33] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-14 08:02:33] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 08:02:33] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-14 08:02:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 162/162 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=207 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2021-05-14 08:02:34] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 08:02:34] [INFO ] Computed 33 place invariants in 0 ms
[2021-05-14 08:02:34] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:34] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 08:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:02:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2021-05-14 08:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:37] [INFO ] [Nat]Absence check using state equation in 3493 ms returned sat
[2021-05-14 08:02:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-14 08:02:37] [INFO ] [Nat]Added 58 Read/Feed constraints in 20 ms returned sat
[2021-05-14 08:02:37] [INFO ] Deduced a trap composed of 1 places in 9 ms of which 0 ms to minimize.
[2021-05-14 08:02:38] [INFO ] Deduced a trap composed of 1 places in 10 ms of which 1 ms to minimize.
[2021-05-14 08:02:38] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 1 ms to minimize.
[2021-05-14 08:02:41] [INFO ] Deduced a trap composed of 1 places in 9 ms of which 4 ms to minimize.
[2021-05-14 08:02:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3400 ms
[2021-05-14 08:02:41] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 9 ms.
[2021-05-14 08:02:43] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 0 ms to minimize.
[2021-05-14 08:02:43] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 08:02:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2021-05-14 08:02:43] [INFO ] Added : 93 causal constraints over 19 iterations in 2634 ms. Result :sat
[2021-05-14 08:02:43] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 08:02:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:02:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:44] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2021-05-14 08:02:44] [INFO ] [Nat]Added 58 Read/Feed constraints in 33 ms returned sat
[2021-05-14 08:02:44] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 1 ms to minimize.
[2021-05-14 08:02:44] [INFO ] Deduced a trap composed of 1 places in 6 ms of which 1 ms to minimize.
[2021-05-14 08:02:44] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 1 ms to minimize.
[2021-05-14 08:02:44] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 08:02:44] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 08:02:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 108 ms
[2021-05-14 08:02:44] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 9 ms.
[2021-05-14 08:02:50] [INFO ] Added : 45 causal constraints over 9 iterations in 6106 ms. Result :unknown
[2021-05-14 08:02:50] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:02:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:02:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:57] [INFO ] [Nat]Absence check using state equation in 6135 ms returned unknown
[2021-05-14 08:02:57] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:02:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:02:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:02:58] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2021-05-14 08:02:58] [INFO ] [Nat]Added 58 Read/Feed constraints in 20 ms returned sat
[2021-05-14 08:02:58] [INFO ] Deduced a trap composed of 1 places in 9 ms of which 0 ms to minimize.
[2021-05-14 08:02:58] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 1 ms to minimize.
[2021-05-14 08:02:58] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 1 ms to minimize.
[2021-05-14 08:02:58] [INFO ] Deduced a trap composed of 1 places in 7 ms of which 0 ms to minimize.
[2021-05-14 08:02:58] [INFO ] Deduced a trap composed of 2 places in 6 ms of which 0 ms to minimize.
[2021-05-14 08:02:58] [INFO ] Deduced a trap composed of 1 places in 5 ms of which 0 ms to minimize.
[2021-05-14 08:02:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 356 ms
[2021-05-14 08:02:58] [INFO ] Computed and/alt/rep : 119/510/118 causal constraints (skipped 27 transitions) in 12 ms.
[2021-05-14 08:03:04] [INFO ] Added : 70 causal constraints over 14 iterations in 6204 ms. Result :unknown
[2021-05-14 08:03:04] [INFO ] [Real]Absence check using 33 positive place invariants in 3 ms returned sat
[2021-05-14 08:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:03:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-14 08:03:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:03:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:03:12] [INFO ] [Nat]Absence check using state equation in 7447 ms returned unknown
[2021-05-14 08:03:12] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2021-05-14 08:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:03:12] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 08:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:03:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2021-05-14 08:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:03:12] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2021-05-14 08:03:12] [INFO ] [Nat]Added 58 Read/Feed constraints in 25 ms returned sat
[2021-05-14 08:03:12] [INFO ] Deduced a trap composed of 1 places in 8 ms of which 1 ms to minimize.
[2021-05-14 08:03:32] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2021-05-14 08:03:32] [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 08:03:32] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:03:32] [INFO ] Flatten gal took : 9 ms
[2021-05-14 08:03:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9653724585028767482.gal : 2 ms
[2021-05-14 08:03:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7465739472989883864.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/ReachabilityCardinality9653724585028767482.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7465739472989883864.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/ReachabilityCardinality9653724585028767482.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7465739472989883864.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7465739472989883864.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :30 after 192
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :192 after 434
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :434 after 2124
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2124 after 9252
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :9252 after 33896
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :33896 after 1.37871e+07
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.37871e+07 after 2.81389e+09
Detected timeout of ITS tools.
[2021-05-14 08:03:47] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:03:47] [INFO ] Applying decomposition
[2021-05-14 08:03:47] [INFO ] Flatten gal took : 22 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/graph1053570743136303518.txt, -o, /tmp/graph1053570743136303518.bin, -w, /tmp/graph1053570743136303518.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/graph1053570743136303518.bin, -l, -1, -v, -w, /tmp/graph1053570743136303518.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:03:47] [INFO ] Decomposing Gal with order
[2021-05-14 08:03:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:03:47] [INFO ] Removed a total of 111 redundant transitions.
[2021-05-14 08:03:47] [INFO ] Flatten gal took : 17 ms
[2021-05-14 08:03:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2021-05-14 08:03:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13285042422550138562.gal : 2 ms
[2021-05-14 08:03:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16279399803332460645.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/ReachabilityCardinality13285042422550138562.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16279399803332460645.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/ReachabilityCardinality13285042422550138562.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16279399803332460645.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16279399803332460645.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 16
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :16 after 64
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :64 after 136
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :136 after 1488
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1488 after 3216
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3216 after 64752
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :64752 after 2.20594e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13343749316324561935
[2021-05-14 08:04:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13343749316324561935
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/ltsmin13343749316324561935]
Compilation finished in 727 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13343749316324561935]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, PaceMakerPTnoneReachabilityCardinality01==true], workingDir=/tmp/ltsmin13343749316324561935]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce isomorphic (modulo) transitions removed 6 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 152
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 28 place count 54 transition count 146
Graph (complete) has 124 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 52 transition count 139
Applied a total of 29 rules in 8 ms. Remains 52 /66 variables (removed 14) and now considering 139/162 (removed 23) transitions.
Running SMT prover for 6 properties.
Normalized transition count is 77 out of 139 initially.
// Phase 1: matrix 77 rows 52 cols
[2021-05-14 08:04:17] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-14 08:04:17] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-14 08:04:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:04:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:24] [INFO ] [Nat]Absence check using state equation in 7370 ms returned sat
[2021-05-14 08:04:24] [INFO ] Computed and/alt/rep : 41/130/41 causal constraints (skipped 1 transitions) in 5 ms.
[2021-05-14 08:04:30] [INFO ] Added : 0 causal constraints over 0 iterations in 6005 ms. Result :unknown
[2021-05-14 08:04:30] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:04:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:32] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2021-05-14 08:04:32] [INFO ] Computed and/alt/rep : 41/130/41 causal constraints (skipped 1 transitions) in 6 ms.
[2021-05-14 08:04:32] [INFO ] Added : 17 causal constraints over 4 iterations in 72 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-14 08:04:32] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 08:04:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:04:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2021-05-14 08:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:39] [INFO ] [Nat]Absence check using state equation in 6240 ms returned unknown
[2021-05-14 08:04:39] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 08:04:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:04:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:42] [INFO ] [Nat]Absence check using state equation in 3209 ms returned sat
[2021-05-14 08:04:42] [INFO ] Computed and/alt/rep : 41/130/41 causal constraints (skipped 1 transitions) in 6 ms.
[2021-05-14 08:04:42] [INFO ] Added : 26 causal constraints over 6 iterations in 100 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-14 08:04:42] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 08:04:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:04:42] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:43] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2021-05-14 08:04:43] [INFO ] Computed and/alt/rep : 41/130/41 causal constraints (skipped 1 transitions) in 6 ms.
[2021-05-14 08:04:43] [INFO ] Added : 30 causal constraints over 6 iterations in 221 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-14 08:04:43] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:43] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 08:04:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:04:43] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2021-05-14 08:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:04:48] [INFO ] [Nat]Absence check using state equation in 4761 ms returned sat
[2021-05-14 08:04:48] [INFO ] Computed and/alt/rep : 41/130/41 causal constraints (skipped 1 transitions) in 6 ms.
[2021-05-14 08:04:48] [INFO ] Added : 18 causal constraints over 4 iterations in 114 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-14 08:04:48] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2021-05-14 08:04:48] [INFO ] Flatten gal took : 12 ms
[2021-05-14 08:04:48] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin4939097167627609027
[2021-05-14 08:04:48] [INFO ] Computing symmetric may disable matrix : 162 transitions.
[2021-05-14 08:04:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:04:48] [INFO ] Computing symmetric may enable matrix : 162 transitions.
[2021-05-14 08:04:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:04:48] [INFO ] Input system was already deterministic with 162 transitions.
[2021-05-14 08:04:48] [INFO ] Computing Do-Not-Accords matrix : 162 transitions.
[2021-05-14 08:04:48] [INFO ] Flatten gal took : 33 ms
[2021-05-14 08:04:48] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph1856757536732580817.txt, -o, /tmp/graph1856757536732580817.bin, -w, /tmp/graph1856757536732580817.weights], workingDir=null]
[2021-05-14 08:04:48] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4939097167627609027
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/ltsmin4939097167627609027]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1856757536732580817.bin, -l, -1, -v, -w, /tmp/graph1856757536732580817.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:04:48] [INFO ] Decomposing Gal with order
[2021-05-14 08:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:04:48] [INFO ] Removed a total of 111 redundant transitions.
[2021-05-14 08:04:48] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2021-05-14 08:04:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7597568082344683522.gal : 1 ms
[2021-05-14 08:04:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17090747455549081709.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/ReachabilityCardinality7597568082344683522.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17090747455549081709.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2021-05-14 08:04:48] [INFO ] Ran tautology test, simplified 0 / 6 in 99 ms.
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/ReachabilityCardinality7597568082344683522.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17090747455549081709.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17090747455549081709.prop.
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-01(UNSAT) depth K=0 took 3 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-02(UNSAT) depth K=0 took 0 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-05(UNSAT) depth K=0 took 1 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-06(UNSAT) depth K=0 took 0 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-09(UNSAT) depth K=0 took 0 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-10(UNSAT) depth K=0 took 0 ms
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 48
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :48 after 96
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :96 after 1008
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-01(UNSAT) depth K=1 took 10 ms
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1008 after 7032
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-02(UNSAT) depth K=1 took 1 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-05(UNSAT) depth K=1 took 1 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-06(UNSAT) depth K=1 took 2 ms
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-09(UNSAT) depth K=1 took 1 ms
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :7032 after 58008
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :58008 after 1.06168e+07
[2021-05-14 08:04:48] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-10(UNSAT) depth K=1 took 8 ms
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.06168e+07 after 2.77217e+09
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.77217e+09 after 1.99135e+11
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 90 out of 162 initially.
// Phase 1: matrix 90 rows 66 cols
[2021-05-14 08:04:49] [INFO ] Computed 33 place invariants in 1 ms
inv : RAConductor + A_RAConductor = 951
inv : SIG_VS + A_SIG_VS = 1
inv : VtrNoiseGenerator + A_VtrNoiseGenerator = 951
inv : PVARP + A_PVARP = 951
inv : Atrium + A_Atrium = 951
inv : RVConductor + A_RVConductor = 951
inv : SIG_Clk0 + A_SIG_Clk0 = 1
inv : SIG_VP + A_SIG_VP = 1
inv : SIG_IncrClk + A_SIG_IncrClk = 1
inv : AVI + A_AVI = 951
inv : URIState + A_URIState = 951
inv : A_dV + A_A_dV = 951
inv : SIG_AgetOut + A_SIG_AgetOut = 1
inv : SIG_AP + A_SIG_AP = 1
inv : VRG + A_VRG = 951
inv : Ventricle + A_Ventricle = 951
inv : SIG_VgetOut + A_SIG_VgetOut = 1
inv : AtrNoiseGenerator + A_AtrNoiseGenerator = 951
inv : SANode + A_SANode = 951
inv : VRP + A_VRP = 951
inv : SIG_Vget + A_SIG_Vget = 1
inv : AVJOut + A_AVJOut = 951
inv : SIG_Aget + A_SIG_Aget = 1
inv : SIG_NextVtrBeat + A_SIG_NextVtrBeat = 1
inv : LRI + A_LRI = 951
inv : SIG_AS + A_SIG_AS = 1
inv : SIG_Vbeat + A_SIG_Vbeat = 1
inv : VRGEctopic + A_VRGEctopic = 951
inv : AVJ + A_AVJ = 951
inv : SANodeEctopic + A_SANodeEctopic = 951
inv : SIG_State + A_SIG_State = 1
inv : SIG_Clk1 + A_SIG_Clk1 = 1
inv : URI + A_URI = 951
Total of 33 invariants.
[2021-05-14 08:04:49] [INFO ] Computed 33 place invariants in 4 ms
[2021-05-14 08:04:49] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-01(UNSAT) depth K=2 took 128 ms
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.99135e+11 after 5.16136e+11
[2021-05-14 08:04:49] [INFO ] Proved 66 variables to be positive in 134 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-01
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-01(SAT) depth K=0 took 3 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-02
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-02(SAT) depth K=0 took 2 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-05
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-05(SAT) depth K=0 took 1 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-06
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-06(SAT) depth K=0 took 2 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-09
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-09(SAT) depth K=0 took 2 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-10
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-10(SAT) depth K=0 took 2 ms
[2021-05-14 08:04:49] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-02(UNSAT) depth K=2 took 131 ms
[2021-05-14 08:04:49] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-05(UNSAT) depth K=2 took 83 ms
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :5.16136e+11 after 5.57276e+13
[2021-05-14 08:04:49] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-06(UNSAT) depth K=2 took 85 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-01
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-01(SAT) depth K=1 took 220 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-02
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-02(SAT) depth K=1 took 8 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-05
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-05(SAT) depth K=1 took 4 ms
[2021-05-14 08:04:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPaceMaker-PT-none-ReachabilityCardinality-06
[2021-05-14 08:04:49] [INFO ] KInduction solution for property PaceMaker-PT-none-ReachabilityCardinality-06(SAT) depth K=1 took 87 ms
[2021-05-14 08:04:49] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-09(UNSAT) depth K=2 took 129 ms
[2021-05-14 08:04:49] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-10(UNSAT) depth K=2 took 89 ms
Compilation finished in 854 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4939097167627609027]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PaceMakerPTnoneReachabilityCardinality01==true], workingDir=/tmp/ltsmin4939097167627609027]
[2021-05-14 08:04:50] [INFO ] BMC solution for property PaceMaker-PT-none-ReachabilityCardinality-01(UNSAT) depth K=3 took 406 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5.57276e+13 after 1.69496e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,9.20912e+16,1.74297,33180,2,1523,17,140270,12,0,1082,151089,0
Total reachable state count : 92091199153766400
Verifying 6 reachability properties.
Reachability property PaceMaker-PT-none-ReachabilityCardinality-01 does not hold.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : PaceMaker-PT-none-ReachabilityCardinality-01
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PaceMaker-PT-none-ReachabilityCardinality-01,0,1.74464,33180,1,0,17,140270,12,0,1084,151089,0
Reachability property PaceMaker-PT-none-ReachabilityCardinality-02 does not hold.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : PaceMaker-PT-none-ReachabilityCardinality-02
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PaceMaker-PT-none-ReachabilityCardinality-02,0,1.74491,33180,1,0,17,140270,12,0,1088,151089,0
Invariant property PaceMaker-PT-none-ReachabilityCardinality-05 is true.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PaceMaker-PT-none-ReachabilityCardinality-05,0,1.74569,33180,1,0,17,140270,12,0,1088,151089,0
Reachability property PaceMaker-PT-none-ReachabilityCardinality-06 does not hold.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : PaceMaker-PT-none-ReachabilityCardinality-06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PaceMaker-PT-none-ReachabilityCardinality-06,0,1.74713,33180,1,0,17,140270,12,0,1093,151089,0
Reachability property PaceMaker-PT-none-ReachabilityCardinality-09 does not hold.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : PaceMaker-PT-none-ReachabilityCardinality-09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PaceMaker-PT-none-ReachabilityCardinality-09,0,1.74803,33180,1,0,17,140270,12,0,1097,151089,0
Invariant property PaceMaker-PT-none-ReachabilityCardinality-10 is true.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PaceMaker-PT-none-ReachabilityCardinality-10,0,1.74893,33180,1,0,17,140270,12,0,1101,151089,0
[2021-05-14 08:04:51] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2021-05-14 08:04:51] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2021-05-14 08:04:51] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-14 08:04:51] [WARNING] Unexpected error occurred while running SMT. Was verifying PaceMaker-PT-none-ReachabilityCardinality-09 K-induction depth 1
Exception in thread "Thread-22" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2021-05-14 08:04:51] [WARNING] Unexpected error occurred while running SMT. Was verifying PaceMaker-PT-none-ReachabilityCardinality-02 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2021-05-14 08:04:51] [INFO ] During BMC, SMT solver timed out at depth 3
[2021-05-14 08:04:51] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2021-05-14 08:04:51] [INFO ] SMT solved 0/ 6 properties. Interrupting SMT analysis.
BK_STOP 1620979492716
--------------------
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="PaceMaker-PT-none"
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 PaceMaker-PT-none, 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-162089127700358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PaceMaker-PT-none.tgz
mv PaceMaker-PT-none 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 ;