About the Execution of ITS-Tools for ShieldRVt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
235.352 | 34584.00 | 53337.00 | 355.40 | TFTFFFFFFFTFFFFT | 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.r235-smll-162106564700270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 ShieldRVt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564700270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 119K May 5 16:52 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 ShieldRVt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1621256493105
Running Version 0
[2021-05-17 13:01:36] [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-17 13:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:01:36] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2021-05-17 13:01:36] [INFO ] Transformed 503 places.
[2021-05-17 13:01:36] [INFO ] Transformed 503 transitions.
[2021-05-17 13:01:36] [INFO ] Found NUPN structural information;
[2021-05-17 13:01:36] [INFO ] Parsed PT model containing 503 places and 503 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :6
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 503 rows 503 cols
[2021-05-17 13:01:36] [INFO ] Computed 41 place invariants in 29 ms
[2021-05-17 13:01:37] [INFO ] [Real]Absence check using 41 positive place invariants in 48 ms returned sat
[2021-05-17 13:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:01:37] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2021-05-17 13:01:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:01:38] [INFO ] [Real]Absence check using 41 positive place invariants in 36 ms returned sat
[2021-05-17 13:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:01:38] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-17 13:01:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:01:39] [INFO ] [Real]Absence check using 41 positive place invariants in 31 ms returned sat
[2021-05-17 13:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:01:39] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-17 13:01:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:01:39] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2021-05-17 13:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:01:39] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-17 13:01:40] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 6 ms to minimize.
[2021-05-17 13:01:40] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 2 ms to minimize.
[2021-05-17 13:01:40] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 2 ms to minimize.
[2021-05-17 13:01:40] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2021-05-17 13:01:40] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 1 ms to minimize.
[2021-05-17 13:01:41] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2021-05-17 13:01:41] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 1 ms to minimize.
[2021-05-17 13:01:41] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 1 ms to minimize.
[2021-05-17 13:01:41] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2021-05-17 13:01:41] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2021-05-17 13:01:42] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 2 ms to minimize.
[2021-05-17 13:01:42] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 1 ms to minimize.
[2021-05-17 13:01:42] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 1 ms to minimize.
[2021-05-17 13:01:42] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2021-05-17 13:01:42] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2021-05-17 13:01:43] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2021-05-17 13:01:43] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2021-05-17 13:01:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3599 ms
[2021-05-17 13:01:43] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 85 ms.
[2021-05-17 13:01:44] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 1 ms to minimize.
[2021-05-17 13:01:44] [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 2
[2021-05-17 13:01:44] [INFO ] [Real]Absence check using 41 positive place invariants in 26 ms returned sat
[2021-05-17 13:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:01:45] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2021-05-17 13:01:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:01:45] [INFO ] [Nat]Absence check using 41 positive place invariants in 40 ms returned sat
[2021-05-17 13:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:01:45] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2021-05-17 13:01:45] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 1 ms to minimize.
[2021-05-17 13:01:46] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 1 ms to minimize.
[2021-05-17 13:01:46] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 1 ms to minimize.
[2021-05-17 13:01:46] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 1 ms to minimize.
[2021-05-17 13:01:46] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2021-05-17 13:01:47] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2021-05-17 13:01:47] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2021-05-17 13:01:47] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2021-05-17 13:01:47] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2021-05-17 13:01:47] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2021-05-17 13:01:47] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 2 ms to minimize.
[2021-05-17 13:01:48] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2021-05-17 13:01:48] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2021-05-17 13:01:48] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 0 ms to minimize.
[2021-05-17 13:01:48] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2021-05-17 13:01:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2949 ms
[2021-05-17 13:01:48] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 65 ms.
[2021-05-17 13:01:50] [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: Broken pipe ... while checking expression at index 3
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Support contains 16 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 503 transition count 355
Reduce places removed 148 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 355 transition count 352
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 352 transition count 352
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 302 place count 352 transition count 314
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 378 place count 314 transition count 314
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 443 place count 249 transition count 249
Iterating global reduction 3 with 65 rules applied. Total rules applied 508 place count 249 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 510 place count 249 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 511 place count 248 transition count 247
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 511 place count 248 transition count 223
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 559 place count 224 transition count 223
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 741 place count 133 transition count 132
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 791 place count 108 transition count 151
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 792 place count 108 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 794 place count 108 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 796 place count 106 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 797 place count 105 transition count 147
Applied a total of 797 rules in 150 ms. Remains 105 /503 variables (removed 398) and now considering 147/503 (removed 356) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/503 places, 147/503 transitions.
[2021-05-17 13:01:50] [INFO ] Flatten gal took : 79 ms
[2021-05-17 13:01:50] [INFO ] Flatten gal took : 28 ms
[2021-05-17 13:01:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15062874117403311725.gal : 15 ms
[2021-05-17 13:01:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2264630761759074735.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/ReachabilityCardinality15062874117403311725.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2264630761759074735.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/ReachabilityCardinality15062874117403311725.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2264630761759074735.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2264630761759074735.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 318
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :318 after 575
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :575 after 2064
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2064 after 1.1211e+06
Detected timeout of ITS tools.
[2021-05-17 13:02:05] [INFO ] Flatten gal took : 28 ms
[2021-05-17 13:02:05] [INFO ] Applying decomposition
[2021-05-17 13:02:05] [INFO ] Flatten gal took : 31 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/graph10653932724743577641.txt, -o, /tmp/graph10653932724743577641.bin, -w, /tmp/graph10653932724743577641.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/graph10653932724743577641.bin, -l, -1, -v, -w, /tmp/graph10653932724743577641.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 13:02:06] [INFO ] Decomposing Gal with order
[2021-05-17 13:02:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 13:02:06] [INFO ] Removed a total of 197 redundant transitions.
[2021-05-17 13:02:06] [INFO ] Flatten gal took : 109 ms
[2021-05-17 13:02:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 21 ms.
[2021-05-17 13:02:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8523529209437537307.gal : 8 ms
[2021-05-17 13:02:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14610495036875031101.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/ReachabilityCardinality8523529209437537307.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14610495036875031101.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/ReachabilityCardinality8523529209437537307.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14610495036875031101.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14610495036875031101.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9792 after 412224
Invariant property ShieldRVt-PT-010B-ReachabilityCardinality-03 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :412224 after 2.68848e+13
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\_flat,7.67103e+14,0.152191,6564,127,32,5219,166,330,12096,73,813,0
Total reachable state count : 767102633922112
Verifying 2 reachability properties.
Invariant property ShieldRVt-PT-010B-ReachabilityCardinality-03 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-010B-ReachabilityCardinality-03,3.78816e+12,0.15743,6668,69,24,5219,166,359,12096,80,813,136
Invariant property ShieldRVt-PT-010B-ReachabilityCardinality-10 is true.
FORMULA ShieldRVt-PT-010B-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
ShieldRVt-PT-010B-ReachabilityCardinality-10,0,0.159066,6668,1,0,5219,166,372,12096,81,813,222
All properties solved without resorting to model-checking.
BK_STOP 1621256527689
--------------------
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="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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 r235-smll-162106564700270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B 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 ;