fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089127600287
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for NoC3x3-PT-4B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
565.428 68990.00 83867.00 1109.10 TTFTTTTTTTFFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127600287.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-4B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127600287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 608K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620959796185

Running Version 0
[2021-05-14 02:36:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 02:36:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 02:36:37] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2021-05-14 02:36:37] [INFO ] Transformed 2328 places.
[2021-05-14 02:36:37] [INFO ] Transformed 2701 transitions.
[2021-05-14 02:36:37] [INFO ] Found NUPN structural information;
[2021-05-14 02:36:37] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :8
FORMULA NoC3x3-PT-4B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-4B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2701 rows 2328 cols
[2021-05-14 02:36:38] [INFO ] Computed 66 place invariants in 44 ms
[2021-05-14 02:36:38] [INFO ] [Real]Absence check using 66 positive place invariants in 64 ms returned sat
[2021-05-14 02:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:39] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2021-05-14 02:36:40] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 180 ms.
[2021-05-14 02:36:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:36:41] [INFO ] [Nat]Absence check using 66 positive place invariants in 66 ms returned sat
[2021-05-14 02:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:42] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2021-05-14 02:36:42] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 171 ms.
[2021-05-14 02:36:45] [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 0
[2021-05-14 02:36:46] [INFO ] [Real]Absence check using 66 positive place invariants in 64 ms returned sat
[2021-05-14 02:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:47] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2021-05-14 02:36:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:36:47] [INFO ] [Nat]Absence check using 66 positive place invariants in 45 ms returned unsat
[2021-05-14 02:36:48] [INFO ] [Real]Absence check using 66 positive place invariants in 60 ms returned sat
[2021-05-14 02:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:49] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2021-05-14 02:36:49] [INFO ] Deduced a trap composed of 121 places in 260 ms of which 4 ms to minimize.
[2021-05-14 02:36:49] [INFO ] Deduced a trap composed of 108 places in 176 ms of which 2 ms to minimize.
[2021-05-14 02:36:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2021-05-14 02:36:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:36:50] [INFO ] [Nat]Absence check using 66 positive place invariants in 64 ms returned sat
[2021-05-14 02:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:51] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2021-05-14 02:36:51] [INFO ] Deduced a trap composed of 121 places in 195 ms of which 2 ms to minimize.
[2021-05-14 02:36:51] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 9 ms to minimize.
[2021-05-14 02:36:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 612 ms
[2021-05-14 02:36:51] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 174 ms.
[2021-05-14 02:36:55] [INFO ] Deduced a trap composed of 7 places in 1042 ms of which 11 ms to minimize.
[2021-05-14 02:36:55] [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-14 02:36:56] [INFO ] [Real]Absence check using 66 positive place invariants in 61 ms returned sat
[2021-05-14 02:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:57] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2021-05-14 02:36:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:36:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 60 ms returned sat
[2021-05-14 02:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:36:58] [INFO ] [Nat]Absence check using state equation in 1017 ms returned sat
[2021-05-14 02:36:59] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 1 ms to minimize.
[2021-05-14 02:36:59] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 0 ms to minimize.
[2021-05-14 02:36:59] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 2 ms to minimize.
[2021-05-14 02:36:59] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 1 ms to minimize.
[2021-05-14 02:37:00] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 0 ms to minimize.
[2021-05-14 02:37:00] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 1 ms to minimize.
[2021-05-14 02:37:00] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 1 ms to minimize.
[2021-05-14 02:37:00] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 0 ms to minimize.
[2021-05-14 02:37:00] [INFO ] Deduced a trap composed of 119 places in 88 ms of which 0 ms to minimize.
[2021-05-14 02:37:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2142 ms
[2021-05-14 02:37:01] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 144 ms.
[2021-05-14 02:37:03] [INFO ] Deduced a trap composed of 7 places in 1029 ms of which 7 ms to minimize.
[2021-05-14 02:37:03] [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 3
[2021-05-14 02:37:03] [INFO ] [Real]Absence check using 66 positive place invariants in 63 ms returned sat
[2021-05-14 02:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:37:04] [INFO ] [Real]Absence check using state equation in 1026 ms returned sat
[2021-05-14 02:37:05] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 0 ms to minimize.
[2021-05-14 02:37:05] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 0 ms to minimize.
[2021-05-14 02:37:05] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 0 ms to minimize.
[2021-05-14 02:37:05] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 0 ms to minimize.
[2021-05-14 02:37:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 987 ms
[2021-05-14 02:37:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:37:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 63 ms returned sat
[2021-05-14 02:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:37:07] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2021-05-14 02:37:07] [INFO ] Deduced a trap composed of 101 places in 192 ms of which 0 ms to minimize.
[2021-05-14 02:37:07] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 1 ms to minimize.
[2021-05-14 02:37:08] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 1 ms to minimize.
[2021-05-14 02:37:08] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
[2021-05-14 02:37:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 995 ms
[2021-05-14 02:37:08] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 133 ms.
[2021-05-14 02:37:12] [INFO ] Deduced a trap composed of 7 places in 1010 ms of which 6 ms to minimize.
[2021-05-14 02:37:12] [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 4
[2021-05-14 02:37:12] [INFO ] [Real]Absence check using 66 positive place invariants in 59 ms returned sat
[2021-05-14 02:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:37:13] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2021-05-14 02:37:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:37:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 60 ms returned sat
[2021-05-14 02:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:37:14] [INFO ] [Nat]Absence check using state equation in 988 ms returned sat
[2021-05-14 02:37:15] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 0 ms to minimize.
[2021-05-14 02:37:15] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 0 ms to minimize.
[2021-05-14 02:37:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2021-05-14 02:37:15] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 137 ms.
[2021-05-14 02:37:19] [INFO ] Deduced a trap composed of 7 places in 1013 ms of which 2 ms to minimize.
[2021-05-14 02:37:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-14 02:37:19] [INFO ] [Real]Absence check using 66 positive place invariants in 61 ms returned sat
[2021-05-14 02:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:37:20] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2021-05-14 02:37:21] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 0 ms to minimize.
[2021-05-14 02:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2021-05-14 02:37:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:37:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 62 ms returned sat
[2021-05-14 02:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:37:22] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2021-05-14 02:37:22] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 0 ms to minimize.
[2021-05-14 02:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2021-05-14 02:37:22] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 132 ms.
[2021-05-14 02:37: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 6
FORMULA NoC3x3-PT-4B-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 25 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2266 edges and 2328 vertex of which 1230 / 2328 are part of one of the 32 SCC in 25 ms
Free SCC test removed 1198 places
Drop transitions removed 1440 transitions
Reduce isomorphic transitions removed 1440 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 1130 transition count 1127
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 152 rules applied. Total rules applied 287 place count 996 transition count 1109
Reduce places removed 3 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 19 rules applied. Total rules applied 306 place count 993 transition count 1093
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 326 place count 977 transition count 1089
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 326 place count 977 transition count 1088
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 328 place count 976 transition count 1088
Discarding 318 places :
Symmetric choice reduction at 4 with 318 rule applications. Total rules 646 place count 658 transition count 770
Iterating global reduction 4 with 318 rules applied. Total rules applied 964 place count 658 transition count 770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 966 place count 658 transition count 768
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 57 Pre rules applied. Total rules applied 966 place count 658 transition count 711
Deduced a syphon composed of 57 places in 5 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 1080 place count 601 transition count 711
Discarding 52 places :
Symmetric choice reduction at 5 with 52 rule applications. Total rules 1132 place count 549 transition count 628
Iterating global reduction 5 with 52 rules applied. Total rules applied 1184 place count 549 transition count 628
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 5 with 256 rules applied. Total rules applied 1440 place count 421 transition count 500
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1445 place count 421 transition count 495
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1461 place count 413 transition count 576
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1465 place count 413 transition count 572
Free-agglomeration rule applied 174 times.
Iterating global reduction 7 with 174 rules applied. Total rules applied 1639 place count 413 transition count 398
Reduce places removed 174 places and 0 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 748 edges and 239 vertex of which 187 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Iterating post reduction 7 with 206 rules applied. Total rules applied 1845 place count 187 transition count 347
Drop transitions removed 54 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 8 with 66 rules applied. Total rules applied 1911 place count 187 transition count 281
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1912 place count 187 transition count 281
Applied a total of 1912 rules in 365 ms. Remains 187 /2328 variables (removed 2141) and now considering 281/2701 (removed 2420) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/2328 places, 281/2701 transitions.
[2021-05-14 02:37:26] [INFO ] Flatten gal took : 65 ms
[2021-05-14 02:37:26] [INFO ] Flatten gal took : 25 ms
[2021-05-14 02:37:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16261875875181517030.gal : 12 ms
[2021-05-14 02:37:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17768355300750893810.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/ReachabilityCardinality16261875875181517030.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17768355300750893810.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/ReachabilityCardinality16261875875181517030.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17768355300750893810.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17768355300750893810.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :5 after 11
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :11 after 40
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :40 after 123
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :123 after 2737
Reachability property NoC3x3-PT-4B-ReachabilityFireability-15 is true.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :2737 after 2.70962e+07
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2.70962e+07 after 3.16122e+08
Reachability property NoC3x3-PT-4B-ReachabilityFireability-09 is true.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3.16122e+08 after 1.79646e+09
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.79646e+09 after 2.62897e+09
Detected timeout of ITS tools.
[2021-05-14 02:37:42] [INFO ] Flatten gal took : 23 ms
[2021-05-14 02:37:42] [INFO ] Applying decomposition
[2021-05-14 02:37:42] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6498223284673455912.txt, -o, /tmp/graph6498223284673455912.bin, -w, /tmp/graph6498223284673455912.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/graph6498223284673455912.bin, -l, -1, -v, -w, /tmp/graph6498223284673455912.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 02:37:42] [INFO ] Decomposing Gal with order
[2021-05-14 02:37:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 02:37:42] [INFO ] Removed a total of 176 redundant transitions.
[2021-05-14 02:37:42] [INFO ] Flatten gal took : 57 ms
[2021-05-14 02:37:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 18 ms.
[2021-05-14 02:37:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10274824085183169471.gal : 5 ms
[2021-05-14 02:37:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10867922503825679532.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/ReachabilityCardinality10274824085183169471.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10867922503825679532.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/ReachabilityCardinality10274824085183169471.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10867922503825679532.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10867922503825679532.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :17 after 33
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :33 after 241
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :241 after 967729
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :967729 after 1.80641e+07
Invariant property NoC3x3-PT-4B-ReachabilityFireability-10 does not hold.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property NoC3x3-PT-4B-ReachabilityFireability-04 is true.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.80641e+07 after 3.82375e+11
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3.82375e+11 after 1.30964e+13
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.30964e+13 after 4.45659e+17
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,1.31168e+21,0.091895,7384,190,250,2588,4977,618,3310,344,7127,0
Total reachable state count : 1311681570845184000000

Verifying 4 reachability properties.
Reachability property NoC3x3-PT-4B-ReachabilityFireability-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
NoC3x3-PT-4B-ReachabilityFireability-04,5.73606e+18,0.092569,7384,103,223,2588,4977,625,3310,346,7127,7
Invariant property NoC3x3-PT-4B-ReachabilityFireability-10 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
NoC3x3-PT-4B-ReachabilityFireability-10,3.21359e+19,0.093998,7384,165,237,2588,4977,660,3310,355,7127,97
Reachability property NoC3x3-PT-4B-ReachabilityFireability-12 is true.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-12 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
NoC3x3-PT-4B-ReachabilityFireability-12,6.09769e+19,0.094676,7384,142,231,2588,4977,662,3310,358,7127,164
Invariant property NoC3x3-PT-4B-ReachabilityFireability-14 does not hold.
FORMULA NoC3x3-PT-4B-ReachabilityFireability-14 FALSE 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
NoC3x3-PT-4B-ReachabilityFireability-14,9.74613e+19,0.095933,7384,191,244,2588,4977,678,3310,362,7127,288
All properties solved without resorting to model-checking.

BK_STOP 1620959865175

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="NoC3x3-PT-4B"
export BK_EXAMINATION="ReachabilityFireability"
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 NoC3x3-PT-4B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127600287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4B.tgz
mv NoC3x3-PT-4B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;