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

About the Execution of ITS-Tools for NoC3x3-PT-7A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
975.199 73254.00 84804.00 5985.20 TTTTFTTFTFTTTTFT 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-162089127700327.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-7A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127700327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K 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.5K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 355K 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-7A-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620971117134

Running Version 0
[2021-05-14 05:45:18] [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 05:45:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 05:45:18] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2021-05-14 05:45:18] [INFO ] Transformed 801 places.
[2021-05-14 05:45:18] [INFO ] Transformed 1544 transitions.
[2021-05-14 05:45:18] [INFO ] Found NUPN structural information;
[2021-05-14 05:45:18] [INFO ] Parsed PT model containing 801 places and 1544 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 16) seen :9
FORMULA NoC3x3-PT-7A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2021-05-14 05:45:19] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
// Phase 1: matrix 1355 rows 801 cols
[2021-05-14 05:45:19] [INFO ] Computed 111 place invariants in 54 ms
[2021-05-14 05:45:19] [INFO ] [Real]Absence check using 82 positive place invariants in 29 ms returned sat
[2021-05-14 05:45:19] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-14 05:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:19] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2021-05-14 05:45:20] [INFO ] State equation strengthened by 52 read => feed constraints.
[2021-05-14 05:45:20] [INFO ] [Real]Added 52 Read/Feed constraints in 13 ms returned sat
[2021-05-14 05:45:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:45:20] [INFO ] [Nat]Absence check using 82 positive place invariants in 32 ms returned sat
[2021-05-14 05:45:20] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-14 05:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:20] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-14 05:45:20] [INFO ] [Nat]Added 52 Read/Feed constraints in 15 ms returned sat
[2021-05-14 05:45:20] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 4 ms to minimize.
[2021-05-14 05:45:20] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2021-05-14 05:45:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2021-05-14 05:45:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2021-05-14 05:45:21] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 93 ms.
[2021-05-14 05:45:25] [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 05:45:25] [INFO ] [Real]Absence check using 82 positive place invariants in 38 ms returned sat
[2021-05-14 05:45:25] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-14 05:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:25] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2021-05-14 05:45:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:45:25] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2021-05-14 05:45:25] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-14 05:45:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:26] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2021-05-14 05:45:26] [INFO ] [Nat]Added 52 Read/Feed constraints in 13 ms returned sat
[2021-05-14 05:45:26] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 89 ms.
[2021-05-14 05:45:31] [INFO ] Deduced a trap composed of 2 places in 357 ms of which 2 ms to minimize.
[2021-05-14 05:45:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 05:45:31] [INFO ] [Real]Absence check using 82 positive place invariants in 25 ms returned sat
[2021-05-14 05:45:31] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-14 05:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:31] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2021-05-14 05:45:31] [INFO ] [Real]Added 52 Read/Feed constraints in 11 ms returned sat
[2021-05-14 05:45:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:45:31] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2021-05-14 05:45:31] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-14 05:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:32] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2021-05-14 05:45:32] [INFO ] [Nat]Added 52 Read/Feed constraints in 10 ms returned sat
[2021-05-14 05:45:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2021-05-14 05:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-14 05:45:32] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 90 ms.
[2021-05-14 05:45:36] [INFO ] Added : 380 causal constraints over 76 iterations in 4437 ms. Result :unknown
[2021-05-14 05:45:36] [INFO ] [Real]Absence check using 82 positive place invariants in 24 ms returned sat
[2021-05-14 05:45:36] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-14 05:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:37] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-14 05:45:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:45:37] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2021-05-14 05:45:37] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-14 05:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:37] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2021-05-14 05:45:37] [INFO ] [Nat]Added 52 Read/Feed constraints in 14 ms returned sat
[2021-05-14 05:45:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2021-05-14 05:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2021-05-14 05:45:37] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 68 ms.
[2021-05-14 05:45:42] [INFO ] Deduced a trap composed of 2 places in 383 ms of which 1 ms to minimize.
[2021-05-14 05:45:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 05:45:42] [INFO ] [Real]Absence check using 82 positive place invariants in 24 ms returned sat
[2021-05-14 05:45:42] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-14 05:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:42] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-14 05:45:43] [INFO ] [Real]Added 52 Read/Feed constraints in 37 ms returned sat
[2021-05-14 05:45:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:45:43] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2021-05-14 05:45:43] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-14 05:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:43] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2021-05-14 05:45:43] [INFO ] [Nat]Added 52 Read/Feed constraints in 13 ms returned sat
[2021-05-14 05:45:43] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2021-05-14 05:45:43] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2021-05-14 05:45:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2021-05-14 05:45:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2021-05-14 05:45:44] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2021-05-14 05:45:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2021-05-14 05:45:44] [INFO ] Deduced a trap composed of 21 places in 16 ms of which 0 ms to minimize.
[2021-05-14 05:45:44] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2021-05-14 05:45:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 648 ms
[2021-05-14 05:45:44] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 83 ms.
[2021-05-14 05:45:48] [INFO ] Deduced a trap composed of 2 places in 374 ms of which 1 ms to minimize.
[2021-05-14 05:45:48] [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 05:45:48] [INFO ] [Real]Absence check using 82 positive place invariants in 26 ms returned sat
[2021-05-14 05:45:48] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-14 05:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:49] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2021-05-14 05:45:49] [INFO ] [Real]Added 52 Read/Feed constraints in 13 ms returned sat
[2021-05-14 05:45:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:45:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2021-05-14 05:45:49] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-14 05:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:45:49] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2021-05-14 05:45:49] [INFO ] [Nat]Added 52 Read/Feed constraints in 11 ms returned sat
[2021-05-14 05:45:49] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2021-05-14 05:45:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2021-05-14 05:45:49] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 79 ms.
[2021-05-14 05:45:54] [INFO ] Deduced a trap composed of 2 places in 332 ms of which 1 ms to minimize.
[2021-05-14 05:45:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-14 05:45:54] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned unsat
FORMULA NoC3x3-PT-7A-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 132700 steps, including 864 resets, run finished after 699 ms. (steps per millisecond=189 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA NoC3x3-PT-7A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 19 out of 801 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 731 edges and 801 vertex of which 102 / 801 are part of one of the 9 SCC in 1128 ms
Free SCC test removed 93 places
Drop transitions removed 186 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 205 transitions.
Discarding 176 places :
Symmetric choice reduction at 0 with 176 rule applications. Total rules 177 place count 532 transition count 973
Ensure Unique test removed 42 places
Iterating global reduction 0 with 218 rules applied. Total rules applied 395 place count 490 transition count 973
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 71 rules applied. Total rules applied 466 place count 490 transition count 902
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 478 place count 478 transition count 902
Performed 134 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 746 place count 344 transition count 744
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 2 with 82 rules applied. Total rules applied 828 place count 344 transition count 662
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 858 place count 329 transition count 641
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 869 place count 329 transition count 630
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 897 place count 315 transition count 638
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 1005 place count 315 transition count 530
Reduce places removed 8 places and 0 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 4 with 9 rules applied. Total rules applied 1014 place count 307 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1015 place count 306 transition count 529
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 1015 place count 306 transition count 523
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1027 place count 300 transition count 523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1031 place count 298 transition count 521
Free-agglomeration rule applied 43 times with reduction of 24 identical transitions.
Iterating global reduction 6 with 43 rules applied. Total rules applied 1074 place count 298 transition count 454
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 68 rules applied. Total rules applied 1142 place count 255 transition count 429
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1149 place count 255 transition count 422
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1151 place count 255 transition count 420
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1154 place count 253 transition count 419
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 1171 place count 253 transition count 452
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1195 place count 236 transition count 445
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 1225 place count 236 transition count 415
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 1261 place count 236 transition count 415
Applied a total of 1261 rules in 1507 ms. Remains 236 /801 variables (removed 565) and now considering 415/1437 (removed 1022) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/801 places, 415/1437 transitions.
[2021-05-14 05:45:57] [INFO ] Flatten gal took : 84 ms
[2021-05-14 05:45:57] [INFO ] Flatten gal took : 29 ms
[2021-05-14 05:45:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13191616223973268541.gal : 16 ms
[2021-05-14 05:45:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18185402849171272606.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/ReachabilityCardinality13191616223973268541.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18185402849171272606.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/ReachabilityCardinality13191616223973268541.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18185402849171272606.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18185402849171272606.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :2 after 15
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 31
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :31 after 346
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :346 after 916
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :916 after 8221
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8221 after 52145
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :52145 after 932988
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :932988 after 1.89796e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.89796e+07 after 4.53032e+09
Detected timeout of ITS tools.
[2021-05-14 05:46:12] [INFO ] Flatten gal took : 25 ms
[2021-05-14 05:46:12] [INFO ] Applying decomposition
[2021-05-14 05:46:12] [INFO ] Flatten gal took : 24 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/graph12400560000797691637.txt, -o, /tmp/graph12400560000797691637.bin, -w, /tmp/graph12400560000797691637.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/graph12400560000797691637.bin, -l, -1, -v, -w, /tmp/graph12400560000797691637.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 05:46:12] [INFO ] Decomposing Gal with order
[2021-05-14 05:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:46:12] [INFO ] Removed a total of 236 redundant transitions.
[2021-05-14 05:46:12] [INFO ] Flatten gal took : 71 ms
[2021-05-14 05:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 16 ms.
[2021-05-14 05:46:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14652395652765511679.gal : 7 ms
[2021-05-14 05:46:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13621088033582005769.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/ReachabilityCardinality14652395652765511679.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13621088033582005769.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/ReachabilityCardinality14652395652765511679.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13621088033582005769.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13621088033582005769.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :13 after 541
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :541 after 17629
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17629 after 273117
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :273117 after 1.06302e+10
Invariant property NoC3x3-PT-7A-ReachabilityFireability-09 does not hold.
FORMULA NoC3x3-PT-7A-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.06302e+10 after 7.76291e+12
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :7.76291e+12 after 3.99746e+15
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.99746e+15 after 5.06729e+15
Reachability property NoC3x3-PT-7A-ReachabilityFireability-12 is true.
FORMULA NoC3x3-PT-7A-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.06729e+15 after 1.23196e+16
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.23196e+16 after 1.70514e+17
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.70514e+17 after 1.54146e+19
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.54146e+19 after 1.54818e+23
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11569536739574458295
[2021-05-14 05:46:27] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11569536739574458295
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11569536739574458295]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11569536739574458295] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11569536739574458295] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 145403 steps, including 0 resets, run visited all 2 properties in 797 ms. (steps per millisecond=182 )
FORMULA NoC3x3-PT-7A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620971190388

--------------------
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-7A"
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-7A, 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-162089127700327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7A.tgz
mv NoC3x3-PT-7A 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 ;