About the Execution of ITS-Tools for PolyORBNT-COL-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.815 | 3600000.00 | 3530448.00 | 182752.10 | ? 1 4 61 5 3 1 2 2 2 61 1 1 4 4 61 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300387.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300387
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K 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 3.7K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 12:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 12:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 94K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621213340076
Running Version 0
[2021-05-17 01:02:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-17 01:02:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 01:02:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 01:02:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 01:02:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 700 ms
[2021-05-17 01:02:23] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 01:02:23] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 01:02:23] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 01:02:23] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 01:02:23] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 01:02:23] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 01:02:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-17 01:02:23] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 28 ms.
[2021-05-17 01:02:23] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3421808220783836125.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 01:02:23] [INFO ] Computed 13 place invariants in 7 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 01:02:23] [INFO ] Unfolded HLPN to a Petri net with 969 places and 1375 transitions in 62 ms.
[2021-05-17 01:02:23] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 01:02:23] [INFO ] Computed 13 place invariants in 7 ms
[2021-05-17 01:02:23] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 01:02:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 01:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:23] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 01:02:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-17 01:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:02:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:02:23] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2021-05-17 01:02:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2021-05-17 01:02:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 01:02:24] [INFO ] Added : 23 causal constraints over 5 iterations in 330 ms. Result :sat
Minimization took 286 ms.
[2021-05-17 01:02:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-17 01:02:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:24] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:02:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 01:02:24] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2021-05-17 01:02:24] [INFO ] Deduced a trap composed of 25 places in 16 ms of which 1 ms to minimize.
[2021-05-17 01:02:24] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 2 ms to minimize.
[2021-05-17 01:02:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 69 ms
[2021-05-17 01:02:24] [INFO ] Added : 36 causal constraints over 8 iterations in 218 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 01:02:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 01:02:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-17 01:02:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 01:02:24] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2021-05-17 01:02:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-17 01:02:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-17 01:02:25] [INFO ] Added : 21 causal constraints over 5 iterations in 257 ms. Result :sat
Minimization took 173 ms.
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 01:02:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:02:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:02:25] [INFO ] Added : 33 causal constraints over 7 iterations in 105 ms. Result :sat
Minimization took 23 ms.
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 01:02:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 31 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-17 01:02:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:02:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:02:25] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2021-05-17 01:02:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-17 01:02:25] [INFO ] Added : 36 causal constraints over 8 iterations in 206 ms. Result :sat
Minimization took 20 ms.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 01:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2021-05-17 01:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-17 01:02:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:02:26] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 01:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:02:26] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 1 ms to minimize.
[2021-05-17 01:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-17 01:02:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 01:02:26] [INFO ] Added : 18 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 01:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:02:26] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 0 ms to minimize.
[2021-05-17 01:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-17 01:02:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:02:26] [INFO ] Added : 19 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 22 ms.
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:27] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2021-05-17 01:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 36 ms returned sat
[2021-05-17 01:02:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 49 ms returned sat
[2021-05-17 01:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:27] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2021-05-17 01:02:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2021-05-17 01:02:27] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 0 ms to minimize.
[2021-05-17 01:02:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-17 01:02:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:02:28] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
[2021-05-17 01:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2021-05-17 01:02:28] [INFO ] Added : 36 causal constraints over 8 iterations in 494 ms. Result :sat
Minimization took 60 ms.
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:02:28] [INFO ] Added : 36 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 01:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] Deduced a trap composed of 13 places in 11 ms of which 1 ms to minimize.
[2021-05-17 01:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-17 01:02:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:02:28] [INFO ] Added : 22 causal constraints over 5 iterations in 84 ms. Result :sat
Minimization took 22 ms.
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 01:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:02:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:02:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2021-05-17 01:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-17 01:02:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:02:28] [INFO ] Added : 18 causal constraints over 4 iterations in 167 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [10, 1, 10, 5, 3, -1, 2, 2, 2, -1, -1, 4, 10]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 01:02:29] [INFO ] Unfolded HLPN to a Petri net with 969 places and 1375 transitions in 11 ms.
[2021-05-17 01:02:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_1408474053010537954.dot
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Incomplete random walk after 10000 steps, including 679 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :24
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 142 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :18
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :9
[2021-05-17 01:02:29] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2021-05-17 01:02:29] [INFO ] Computed 142 place invariants in 164 ms
[2021-05-17 01:02:29] [INFO ] [Real]Absence check using 135 positive place invariants in 27 ms returned sat
[2021-05-17 01:02:29] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned sat
[2021-05-17 01:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:30] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-17 01:02:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:30] [INFO ] [Nat]Absence check using 135 positive place invariants in 50 ms returned sat
[2021-05-17 01:02:30] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2021-05-17 01:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:30] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2021-05-17 01:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:02:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 423 ms returned sat
[2021-05-17 01:02:31] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 139 ms.
[2021-05-17 01:02:32] [INFO ] Added : 18 causal constraints over 4 iterations in 584 ms. Result :sat
Minimization took 382 ms.
[2021-05-17 01:02:32] [INFO ] [Real]Absence check using 135 positive place invariants in 62 ms returned sat
[2021-05-17 01:02:32] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned unsat
[2021-05-17 01:02:32] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2021-05-17 01:02:32] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2021-05-17 01:02:32] [INFO ] [Real]Absence check using 135 positive place invariants in 27 ms returned sat
[2021-05-17 01:02:32] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned unsat
[2021-05-17 01:02:33] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2021-05-17 01:02:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2021-05-17 01:02:33] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2021-05-17 01:02:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 4, 1, 1, 1, 4] Max seen :[3, 4, 1, 1, 1, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 4500 steps, including 276 resets, run finished after 37 ms. (steps per millisecond=121 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 242 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2021-05-17 01:02:33] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2021-05-17 01:02:33] [INFO ] Computed 137 place invariants in 132 ms
[2021-05-17 01:02:34] [INFO ] Dead Transitions using invariants and state equation in 1023 ms returned [741, 742, 743, 745, 748, 749, 750, 751, 752, 753, 755, 758, 762, 763, 764, 765, 766, 767, 768, 770, 773, 777, 782, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 829, 830, 831, 832, 833, 835, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 864, 865]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[865, 864, 862, 861, 860, 859, 858, 857, 856, 855, 854, 853, 852, 851, 850, 849, 848, 847, 846, 845, 844, 843, 842, 841, 840, 839, 838, 835, 833, 832, 831, 830, 829, 827, 826, 825, 824, 823, 822, 821, 820, 819, 818, 817, 816, 815, 814, 813, 812, 811, 810, 809, 807, 806, 805, 804, 803, 802, 801, 800, 799, 798, 797, 796, 795, 794, 793, 792, 791, 790, 789, 788, 782, 777, 773, 770, 768, 767, 766, 765, 764, 763, 762, 758, 755, 753, 752, 751, 750, 749, 748, 745, 743, 742, 741]
Starting structural reductions, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 60 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:02:34] [INFO ] Computed 137 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 47305 resets, run finished after 4272 ms. (steps per millisecond=234 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3373 resets, run finished after 1486 ms. (steps per millisecond=672 ) properties (out of 1) seen :3
[2021-05-17 01:02:40] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:02:40] [INFO ] Computed 137 place invariants in 18 ms
[2021-05-17 01:02:40] [INFO ] [Real]Absence check using 130 positive place invariants in 51 ms returned sat
[2021-05-17 01:02:40] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 45 ms returned sat
[2021-05-17 01:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:41] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2021-05-17 01:02:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:02:41] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2021-05-17 01:02:41] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2021-05-17 01:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:02:41] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2021-05-17 01:02:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:02:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2021-05-17 01:02:42] [INFO ] Deduced a trap composed of 239 places in 438 ms of which 1 ms to minimize.
[2021-05-17 01:02:42] [INFO ] Deduced a trap composed of 239 places in 246 ms of which 1 ms to minimize.
[2021-05-17 01:02:43] [INFO ] Deduced a trap composed of 242 places in 389 ms of which 1 ms to minimize.
[2021-05-17 01:02:43] [INFO ] Deduced a trap composed of 242 places in 312 ms of which 1 ms to minimize.
[2021-05-17 01:02:43] [INFO ] Deduced a trap composed of 221 places in 443 ms of which 1 ms to minimize.
[2021-05-17 01:02:44] [INFO ] Deduced a trap composed of 233 places in 451 ms of which 1 ms to minimize.
[2021-05-17 01:02:44] [INFO ] Deduced a trap composed of 239 places in 424 ms of which 1 ms to minimize.
[2021-05-17 01:02:45] [INFO ] Deduced a trap composed of 242 places in 435 ms of which 0 ms to minimize.
[2021-05-17 01:02:46] [INFO ] Deduced a trap composed of 236 places in 535 ms of which 1 ms to minimize.
[2021-05-17 01:02:46] [INFO ] Deduced a trap composed of 239 places in 323 ms of which 1 ms to minimize.
[2021-05-17 01:02:46] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 0 ms to minimize.
[2021-05-17 01:02:47] [INFO ] Deduced a trap composed of 230 places in 422 ms of which 2 ms to minimize.
[2021-05-17 01:02:47] [INFO ] Deduced a trap composed of 248 places in 385 ms of which 2 ms to minimize.
[2021-05-17 01:02:50] [INFO ] Deduced a trap composed of 224 places in 2616 ms of which 1 ms to minimize.
[2021-05-17 01:02:51] [INFO ] Deduced a trap composed of 233 places in 432 ms of which 1 ms to minimize.
[2021-05-17 01:02:51] [INFO ] Deduced a trap composed of 263 places in 229 ms of which 1 ms to minimize.
[2021-05-17 01:02:51] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 1 ms to minimize.
[2021-05-17 01:02:52] [INFO ] Deduced a trap composed of 248 places in 210 ms of which 1 ms to minimize.
[2021-05-17 01:02:57] [INFO ] Deduced a trap composed of 248 places in 4902 ms of which 0 ms to minimize.
[2021-05-17 01:02:57] [INFO ] Deduced a trap composed of 236 places in 377 ms of which 1 ms to minimize.
[2021-05-17 01:02:58] [INFO ] Deduced a trap composed of 239 places in 385 ms of which 1 ms to minimize.
[2021-05-17 01:02:58] [INFO ] Deduced a trap composed of 248 places in 380 ms of which 5 ms to minimize.
[2021-05-17 01:02:59] [INFO ] Deduced a trap composed of 242 places in 394 ms of which 1 ms to minimize.
[2021-05-17 01:03:01] [INFO ] Deduced a trap composed of 236 places in 1285 ms of which 0 ms to minimize.
[2021-05-17 01:03:01] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 0 ms to minimize.
[2021-05-17 01:03:01] [INFO ] Deduced a trap composed of 248 places in 225 ms of which 1 ms to minimize.
[2021-05-17 01:03:02] [INFO ] Deduced a trap composed of 248 places in 392 ms of which 1 ms to minimize.
[2021-05-17 01:03:03] [INFO ] Deduced a trap composed of 236 places in 390 ms of which 4 ms to minimize.
[2021-05-17 01:03:04] [INFO ] Deduced a trap composed of 230 places in 424 ms of which 1 ms to minimize.
[2021-05-17 01:03:05] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 1 ms to minimize.
[2021-05-17 01:03:05] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 1 ms to minimize.
[2021-05-17 01:03:08] [INFO ] Deduced a trap composed of 233 places in 200 ms of which 0 ms to minimize.
[2021-05-17 01:03:10] [INFO ] Deduced a trap composed of 245 places in 366 ms of which 1 ms to minimize.
[2021-05-17 01:03:26] [INFO ] Deduced a trap composed of 6 places in 604 ms of which 1 ms to minimize.
[2021-05-17 01:03:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 84 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 69 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2021-05-17 01:03:27] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:27] [INFO ] Computed 137 place invariants in 28 ms
[2021-05-17 01:03:28] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2021-05-17 01:03:28] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:28] [INFO ] Computed 137 place invariants in 23 ms
[2021-05-17 01:03:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:03:31] [INFO ] Implicit Places using invariants and state equation in 3513 ms returned []
Implicit Place search using SMT with State Equation took 4718 ms to find 0 implicit places.
[2021-05-17 01:03:31] [INFO ] Redundant transitions in 102 ms returned []
[2021-05-17 01:03:31] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:31] [INFO ] Computed 137 place invariants in 19 ms
[2021-05-17 01:03:32] [INFO ] Dead Transitions using invariants and state equation in 935 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-00
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:32] [INFO ] Computed 137 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 485 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :3
[2021-05-17 01:03:33] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:33] [INFO ] Computed 137 place invariants in 26 ms
[2021-05-17 01:03:33] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2021-05-17 01:03:33] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2021-05-17 01:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:03:33] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2021-05-17 01:03:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:03:34] [INFO ] [Nat]Absence check using 130 positive place invariants in 48 ms returned sat
[2021-05-17 01:03:34] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 28 ms returned sat
[2021-05-17 01:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:03:34] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2021-05-17 01:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:03:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 87 ms returned sat
[2021-05-17 01:03:35] [INFO ] Deduced a trap composed of 239 places in 456 ms of which 1 ms to minimize.
[2021-05-17 01:03:35] [INFO ] Deduced a trap composed of 239 places in 482 ms of which 2 ms to minimize.
[2021-05-17 01:03:36] [INFO ] Deduced a trap composed of 242 places in 467 ms of which 14 ms to minimize.
[2021-05-17 01:03:36] [INFO ] Deduced a trap composed of 242 places in 476 ms of which 1 ms to minimize.
[2021-05-17 01:03:37] [INFO ] Deduced a trap composed of 221 places in 416 ms of which 1 ms to minimize.
[2021-05-17 01:03:37] [INFO ] Deduced a trap composed of 233 places in 388 ms of which 1 ms to minimize.
[2021-05-17 01:03:38] [INFO ] Deduced a trap composed of 239 places in 398 ms of which 1 ms to minimize.
[2021-05-17 01:03:38] [INFO ] Deduced a trap composed of 242 places in 467 ms of which 25 ms to minimize.
[2021-05-17 01:03:39] [INFO ] Deduced a trap composed of 236 places in 379 ms of which 1 ms to minimize.
[2021-05-17 01:03:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 22 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2021-05-17 01:03:39] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:39] [INFO ] Computed 137 place invariants in 21 ms
[2021-05-17 01:03:40] [INFO ] Dead Transitions using invariants and state equation in 1372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:40] [INFO ] Computed 137 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 47223 resets, run finished after 3745 ms. (steps per millisecond=267 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 3295 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 1) seen :3
[2021-05-17 01:03:45] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:03:45] [INFO ] Computed 137 place invariants in 20 ms
[2021-05-17 01:03:45] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2021-05-17 01:03:45] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2021-05-17 01:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:03:46] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-17 01:03:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:03:46] [INFO ] [Nat]Absence check using 130 positive place invariants in 68 ms returned sat
[2021-05-17 01:03:46] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 26 ms returned sat
[2021-05-17 01:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:03:46] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2021-05-17 01:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:03:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2021-05-17 01:03:47] [INFO ] Deduced a trap composed of 239 places in 454 ms of which 1 ms to minimize.
[2021-05-17 01:03:48] [INFO ] Deduced a trap composed of 239 places in 458 ms of which 1 ms to minimize.
[2021-05-17 01:03:48] [INFO ] Deduced a trap composed of 242 places in 472 ms of which 2 ms to minimize.
[2021-05-17 01:03:49] [INFO ] Deduced a trap composed of 242 places in 445 ms of which 2 ms to minimize.
[2021-05-17 01:03:49] [INFO ] Deduced a trap composed of 221 places in 428 ms of which 1 ms to minimize.
[2021-05-17 01:03:50] [INFO ] Deduced a trap composed of 233 places in 424 ms of which 1 ms to minimize.
[2021-05-17 01:03:50] [INFO ] Deduced a trap composed of 239 places in 448 ms of which 1 ms to minimize.
[2021-05-17 01:03:50] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 1 ms to minimize.
[2021-05-17 01:03:51] [INFO ] Deduced a trap composed of 236 places in 375 ms of which 1 ms to minimize.
[2021-05-17 01:03:51] [INFO ] Deduced a trap composed of 239 places in 439 ms of which 6 ms to minimize.
[2021-05-17 01:03:52] [INFO ] Deduced a trap composed of 236 places in 439 ms of which 6 ms to minimize.
[2021-05-17 01:03:52] [INFO ] Deduced a trap composed of 230 places in 433 ms of which 8 ms to minimize.
[2021-05-17 01:03:53] [INFO ] Deduced a trap composed of 248 places in 383 ms of which 13 ms to minimize.
[2021-05-17 01:03:53] [INFO ] Deduced a trap composed of 224 places in 189 ms of which 0 ms to minimize.
[2021-05-17 01:03:54] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 1 ms to minimize.
[2021-05-17 01:03:54] [INFO ] Deduced a trap composed of 263 places in 197 ms of which 1 ms to minimize.
[2021-05-17 01:03:54] [INFO ] Deduced a trap composed of 224 places in 373 ms of which 1 ms to minimize.
[2021-05-17 01:03:55] [INFO ] Deduced a trap composed of 248 places in 374 ms of which 1 ms to minimize.
[2021-05-17 01:03:55] [INFO ] Deduced a trap composed of 248 places in 374 ms of which 1 ms to minimize.
[2021-05-17 01:03:56] [INFO ] Deduced a trap composed of 236 places in 377 ms of which 1 ms to minimize.
[2021-05-17 01:03:56] [INFO ] Deduced a trap composed of 239 places in 371 ms of which 1 ms to minimize.
[2021-05-17 01:03:58] [INFO ] Deduced a trap composed of 248 places in 2006 ms of which 1 ms to minimize.
[2021-05-17 01:03:59] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 0 ms to minimize.
[2021-05-17 01:03:59] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2021-05-17 01:04:00] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 1 ms to minimize.
[2021-05-17 01:04:00] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2021-05-17 01:04:01] [INFO ] Deduced a trap composed of 248 places in 370 ms of which 1 ms to minimize.
[2021-05-17 01:04:02] [INFO ] Deduced a trap composed of 236 places in 441 ms of which 1 ms to minimize.
[2021-05-17 01:04:03] [INFO ] Deduced a trap composed of 230 places in 459 ms of which 1 ms to minimize.
[2021-05-17 01:04:04] [INFO ] Deduced a trap composed of 242 places in 379 ms of which 1 ms to minimize.
[2021-05-17 01:04:05] [INFO ] Deduced a trap composed of 239 places in 379 ms of which 1 ms to minimize.
[2021-05-17 01:04:07] [INFO ] Deduced a trap composed of 233 places in 418 ms of which 1 ms to minimize.
[2021-05-17 01:04:10] [INFO ] Deduced a trap composed of 245 places in 400 ms of which 1 ms to minimize.
[2021-05-17 01:04:31] [INFO ] Deduced a trap composed of 6 places in 584 ms of which 1 ms to minimize.
[2021-05-17 01:04:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 47 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 28 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2021-05-17 01:04:31] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:04:31] [INFO ] Computed 137 place invariants in 22 ms
[2021-05-17 01:04:32] [INFO ] Implicit Places using invariants in 979 ms returned []
[2021-05-17 01:04:32] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:04:32] [INFO ] Computed 137 place invariants in 19 ms
[2021-05-17 01:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:04:37] [INFO ] Implicit Places using invariants and state equation in 4705 ms returned []
Implicit Place search using SMT with State Equation took 5699 ms to find 0 implicit places.
[2021-05-17 01:04:37] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 01:04:37] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 01:04:37] [INFO ] Computed 137 place invariants in 19 ms
[2021-05-17 01:04:38] [INFO ] Dead Transitions using invariants and state equation in 1208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-00 in 65837 ms.
[2021-05-17 01:04:39] [INFO ] Flatten gal took : 349 ms
[2021-05-17 01:04:39] [INFO ] Applying decomposition
[2021-05-17 01:04:39] [INFO ] Flatten gal took : 169 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/graph6787879762259859304.txt, -o, /tmp/graph6787879762259859304.bin, -w, /tmp/graph6787879762259859304.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/graph6787879762259859304.bin, -l, -1, -v, -w, /tmp/graph6787879762259859304.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 01:04:39] [INFO ] Decomposing Gal with order
[2021-05-17 01:04:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:04:40] [INFO ] Removed a total of 1081 redundant transitions.
[2021-05-17 01:04:40] [INFO ] Flatten gal took : 490 ms
[2021-05-17 01:04:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 487 labels/synchronizations in 67 ms.
[2021-05-17 01:04:40] [INFO ] Time to serialize gal into /tmp/UpperBounds14858980562376149000.gal : 45 ms
[2021-05-17 01:04:40] [INFO ] Time to serialize properties into /tmp/UpperBounds1885507569670305050.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/UpperBounds14858980562376149000.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1885507569670305050.prop, --nowitness], 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/UpperBounds14858980562376149000.gal -t CGAL -reachable-file /tmp/UpperBounds1885507569670305050.prop --nowitness
Loading property file /tmp/UpperBounds1885507569670305050.prop.
Detected timeout of ITS tools.
[2021-05-17 01:25:28] [INFO ] Applying decomposition
[2021-05-17 01:25:29] [INFO ] Flatten gal took : 673 ms
[2021-05-17 01:25:29] [INFO ] Decomposing Gal with order
[2021-05-17 01:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:25:31] [INFO ] Removed a total of 3944 redundant transitions.
[2021-05-17 01:25:31] [INFO ] Flatten gal took : 1071 ms
[2021-05-17 01:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1608 ms.
[2021-05-17 01:25:33] [INFO ] Time to serialize gal into /tmp/UpperBounds6129348406308449160.gal : 65 ms
[2021-05-17 01:25:33] [INFO ] Time to serialize properties into /tmp/UpperBounds7419785283792589973.prop : 2 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/UpperBounds6129348406308449160.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7419785283792589973.prop, --nowitness], 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/UpperBounds6129348406308449160.gal -t CGAL -reachable-file /tmp/UpperBounds7419785283792589973.prop --nowitness
Loading property file /tmp/UpperBounds7419785283792589973.prop.
Detected timeout of ITS tools.
[2021-05-17 01:46:19] [INFO ] Flatten gal took : 429 ms
[2021-05-17 01:46:21] [INFO ] Input system was already deterministic with 1087 transitions.
[2021-05-17 01:46:21] [INFO ] Transformed 771 places.
[2021-05-17 01:46:21] [INFO ] Transformed 1087 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 01:46:51] [INFO ] Time to serialize gal into /tmp/UpperBounds18427498043170765416.gal : 12 ms
[2021-05-17 01:46:51] [INFO ] Time to serialize properties into /tmp/UpperBounds1196215895813405975.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/UpperBounds18427498043170765416.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1196215895813405975.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/UpperBounds18427498043170765416.gal -t CGAL -reachable-file /tmp/UpperBounds1196215895813405975.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1196215895813405975.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="UpperBounds"
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 PolyORBNT-COL-S05J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089268300387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;