About the Execution of 2021-gold for NoC3x3-PT-3B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 944.579 | 185230.00 | 234324.00 | 909.10 | FTTTTTTTTTFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002700060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is NoC3x3-PT-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002700060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 29 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 29 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 29 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 581K May 10 09:34 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-3B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655069142805
Running Version 0
[2022-06-12 21:25:45] [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]
[2022-06-12 21:25:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:25:46] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2022-06-12 21:25:46] [INFO ] Transformed 2117 places.
[2022-06-12 21:25:46] [INFO ] Transformed 2435 transitions.
[2022-06-12 21:25:46] [INFO ] Found NUPN structural information;
[2022-06-12 21:25:46] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 389 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :8
FORMULA NoC3x3-PT-3B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2022-06-12 21:25:46] [INFO ] Computed 66 place invariants in 51 ms
[2022-06-12 21:25:48] [INFO ] [Real]Absence check using 66 positive place invariants in 166 ms returned sat
[2022-06-12 21:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:51] [INFO ] [Real]Absence check using state equation in 3277 ms returned sat
[2022-06-12 21:25:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 107 ms returned sat
[2022-06-12 21:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:55] [INFO ] [Nat]Absence check using state equation in 2973 ms returned sat
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 44 places in 1240 ms of which 11 ms to minimize.
[2022-06-12 21:25:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:25:57] [INFO ] [Real]Absence check using 66 positive place invariants in 88 ms returned sat
[2022-06-12 21:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:58] [INFO ] [Real]Absence check using state equation in 1718 ms returned sat
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 35 places in 533 ms of which 3 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 77 places in 491 ms of which 3 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 68 places in 440 ms of which 1 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 88 places in 353 ms of which 2 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 1 ms to minimize.
[2022-06-12 21:26:01] [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
[2022-06-12 21:26:02] [INFO ] [Real]Absence check using 66 positive place invariants in 101 ms returned sat
[2022-06-12 21:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:04] [INFO ] [Real]Absence check using state equation in 2352 ms returned sat
[2022-06-12 21:26:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:05] [INFO ] [Nat]Absence check using 66 positive place invariants in 114 ms returned unsat
[2022-06-12 21:26:06] [INFO ] [Real]Absence check using 66 positive place invariants in 136 ms returned sat
[2022-06-12 21:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:07] [INFO ] [Real]Absence check using state equation in 1397 ms returned sat
[2022-06-12 21:26:08] [INFO ] Deduced a trap composed of 103 places in 641 ms of which 2 ms to minimize.
[2022-06-12 21:26:09] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 2 ms to minimize.
[2022-06-12 21:26:09] [INFO ] Deduced a trap composed of 69 places in 523 ms of which 2 ms to minimize.
[2022-06-12 21:26:10] [INFO ] Deduced a trap composed of 92 places in 466 ms of which 2 ms to minimize.
[2022-06-12 21:26:10] [INFO ] Deduced a trap composed of 73 places in 477 ms of which 1 ms to minimize.
[2022-06-12 21:26:10] [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
[2022-06-12 21:26:11] [INFO ] [Real]Absence check using 66 positive place invariants in 96 ms returned sat
[2022-06-12 21:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:13] [INFO ] [Real]Absence check using state equation in 2210 ms returned sat
[2022-06-12 21:26:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:14] [INFO ] [Nat]Absence check using 66 positive place invariants in 108 ms returned sat
[2022-06-12 21:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:17] [INFO ] [Nat]Absence check using state equation in 2493 ms returned sat
[2022-06-12 21:26:17] [INFO ] Deduced a trap composed of 138 places in 607 ms of which 1 ms to minimize.
[2022-06-12 21:26:18] [INFO ] Deduced a trap composed of 104 places in 762 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 112 places in 573 ms of which 1 ms to minimize.
[2022-06-12 21:26: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 4
[2022-06-12 21:26:20] [INFO ] [Real]Absence check using 66 positive place invariants in 99 ms returned sat
[2022-06-12 21:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:22] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2022-06-12 21:26:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:22] [INFO ] [Nat]Absence check using 66 positive place invariants in 105 ms returned sat
[2022-06-12 21:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:24] [INFO ] [Nat]Absence check using state equation in 2000 ms returned sat
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 54 places in 786 ms of which 1 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 73 places in 762 ms of which 1 ms to minimize.
[2022-06-12 21:26:27] [INFO ] Deduced a trap composed of 91 places in 657 ms of which 2 ms to minimize.
[2022-06-12 21:26:27] [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
[2022-06-12 21:26:27] [INFO ] [Real]Absence check using 66 positive place invariants in 94 ms returned sat
[2022-06-12 21:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:29] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2022-06-12 21:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:29] [INFO ] [Nat]Absence check using 66 positive place invariants in 98 ms returned sat
[2022-06-12 21:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:31] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2022-06-12 21:26:31] [INFO ] Deduced a trap composed of 110 places in 407 ms of which 1 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 73 places in 424 ms of which 1 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 41 places in 427 ms of which 1 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 45 places in 350 ms of which 1 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2161 ms
[2022-06-12 21:26:33] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 184 ms.
[2022-06-12 21:26:35] [INFO ] Deduced a trap composed of 7 places in 1518 ms of which 3 ms to minimize.
[2022-06-12 21:26:35] [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
[2022-06-12 21:26:36] [INFO ] [Real]Absence check using 66 positive place invariants in 101 ms returned sat
[2022-06-12 21:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:38] [INFO ] [Real]Absence check using state equation in 2221 ms returned sat
[2022-06-12 21:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:39] [INFO ] [Nat]Absence check using 66 positive place invariants in 90 ms returned sat
[2022-06-12 21:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:41] [INFO ] [Nat]Absence check using state equation in 2267 ms returned sat
[2022-06-12 21:26:42] [INFO ] Deduced a trap composed of 114 places in 643 ms of which 1 ms to minimize.
[2022-06-12 21:26:42] [INFO ] Deduced a trap composed of 73 places in 557 ms of which 1 ms to minimize.
[2022-06-12 21:26:43] [INFO ] Deduced a trap composed of 52 places in 613 ms of which 2 ms to minimize.
[2022-06-12 21:26:44] [INFO ] Deduced a trap composed of 88 places in 530 ms of which 1 ms to minimize.
[2022-06-12 21:26:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
FORMULA NoC3x3-PT-3B-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 127 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1495 edges and 2117 vertex of which 40 / 2117 are part of one of the 5 SCC in 13 ms
Free SCC test removed 35 places
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 381 transitions
Trivial Post-agglo rules discarded 381 transitions
Performed 381 trivial Post agglomeration. Transition count delta: 381
Iterating post reduction 0 with 386 rules applied. Total rules applied 387 place count 2077 transition count 2014
Reduce places removed 381 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 386 rules applied. Total rules applied 773 place count 1696 transition count 2009
Reduce places removed 2 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 42 rules applied. Total rules applied 815 place count 1694 transition count 1969
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 855 place count 1654 transition count 1969
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 855 place count 1654 transition count 1945
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 903 place count 1630 transition count 1945
Discarding 351 places :
Symmetric choice reduction at 4 with 351 rule applications. Total rules 1254 place count 1279 transition count 1594
Iterating global reduction 4 with 351 rules applied. Total rules applied 1605 place count 1279 transition count 1594
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 1605 place count 1279 transition count 1569
Deduced a syphon composed of 25 places in 13 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1655 place count 1254 transition count 1569
Discarding 118 places :
Symmetric choice reduction at 4 with 118 rule applications. Total rules 1773 place count 1136 transition count 1428
Iterating global reduction 4 with 118 rules applied. Total rules applied 1891 place count 1136 transition count 1428
Discarding 119 places :
Symmetric choice reduction at 4 with 119 rule applications. Total rules 2010 place count 1017 transition count 1298
Iterating global reduction 4 with 119 rules applied. Total rules applied 2129 place count 1017 transition count 1298
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 2163 place count 983 transition count 1237
Iterating global reduction 4 with 34 rules applied. Total rules applied 2197 place count 983 transition count 1237
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2206 place count 983 transition count 1228
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2231 place count 958 transition count 1203
Iterating global reduction 5 with 25 rules applied. Total rules applied 2256 place count 958 transition count 1203
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2260 place count 956 transition count 1201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2262 place count 954 transition count 1201
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2276 place count 940 transition count 1173
Iterating global reduction 7 with 14 rules applied. Total rules applied 2290 place count 940 transition count 1173
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2303 place count 927 transition count 1160
Iterating global reduction 7 with 13 rules applied. Total rules applied 2316 place count 927 transition count 1160
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 15 rules applied. Total rules applied 2331 place count 926 transition count 1146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2332 place count 925 transition count 1146
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 1 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 9 with 536 rules applied. Total rules applied 2868 place count 657 transition count 878
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 2883 place count 642 transition count 862
Iterating global reduction 9 with 15 rules applied. Total rules applied 2898 place count 642 transition count 862
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 2907 place count 633 transition count 844
Iterating global reduction 9 with 9 rules applied. Total rules applied 2916 place count 633 transition count 844
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2917 place count 632 transition count 841
Iterating global reduction 9 with 1 rules applied. Total rules applied 2918 place count 632 transition count 841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2920 place count 631 transition count 840
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 2962 place count 610 transition count 898
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2963 place count 609 transition count 896
Iterating global reduction 9 with 1 rules applied. Total rules applied 2964 place count 609 transition count 896
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2965 place count 609 transition count 895
Free-agglomeration rule applied 39 times.
Iterating global reduction 10 with 39 rules applied. Total rules applied 3004 place count 609 transition count 856
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 3048 place count 570 transition count 851
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 3058 place count 570 transition count 841
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3059 place count 570 transition count 841
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3061 place count 569 transition count 840
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 3074 place count 569 transition count 840
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 3080 place count 569 transition count 840
Applied a total of 3080 rules in 1319 ms. Remains 569 /2117 variables (removed 1548) and now considering 840/2435 (removed 1595) transitions.
Finished structural reductions, in 1 iterations. Remains : 569/2117 places, 840/2435 transitions.
[2022-06-12 21:26:46] [INFO ] Flatten gal took : 172 ms
[2022-06-12 21:26:46] [INFO ] Flatten gal took : 146 ms
[2022-06-12 21:26:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4184723797871525604.gal : 33 ms
[2022-06-12 21:26:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17136476896374700137.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4184723797871525604.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17136476896374700137.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/ReachabilityCardinality4184723797871525604.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17136476896374700137.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17136476896374700137.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :14 after 15
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :15 after 32
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :32 after 67
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :67 after 99
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :99 after 2194
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2194 after 26153
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :26153 after 1.908e+06
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1.908e+06 after 5.60626e+06
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :5.60626e+06 after 1.14791e+09
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.14791e+09 after 7.68765e+09
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :7.68765e+09 after 4.42087e+10
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :4.42087e+10 after 2.6222e+12
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :2.6222e+12 after 6.58641e+13
Detected timeout of ITS tools.
[2022-06-12 21:27:01] [INFO ] Flatten gal took : 82 ms
[2022-06-12 21:27:01] [INFO ] Applying decomposition
[2022-06-12 21:27:01] [INFO ] Flatten gal took : 63 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/graph11180705298358070277.txt, -o, /tmp/graph11180705298358070277.bin, -w, /tmp/graph11180705298358070277.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/graph11180705298358070277.bin, -l, -1, -v, -w, /tmp/graph11180705298358070277.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:27:01] [INFO ] Decomposing Gal with order
[2022-06-12 21:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:27:02] [INFO ] Removed a total of 497 redundant transitions.
[2022-06-12 21:27:02] [INFO ] Flatten gal took : 175 ms
[2022-06-12 21:27:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 44 ms.
[2022-06-12 21:27:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7654039887783642422.gal : 24 ms
[2022-06-12 21:27:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5540928215885010600.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/ReachabilityCardinality7654039887783642422.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5540928215885010600.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/ReachabilityCardinality7654039887783642422.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5540928215885010600.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5540928215885010600.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :1 after 27
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :27 after 29589
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :29589 after 4.47496e+06
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :4.47496e+06 after 3.8151e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :3.8151e+08 after 3.83531e+08
Reachability property NoC3x3-PT-3B-ReachabilityFireability-07 is true.
FORMULA NoC3x3-PT-3B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.83531e+08 after 4.5416e+23
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4.5416e+23 after 3.29618e+27
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11203847283445044183
[2022-06-12 21:27:17] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11203847283445044183
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/ltsmin11203847283445044183]
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/ltsmin11203847283445044183] 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/ltsmin11203847283445044183] 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)
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 3315 ms. (steps per millisecond=301 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3327 ms. (steps per millisecond=300 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2959 ms. (steps per millisecond=337 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1397 ms. (steps per millisecond=715 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 3792 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 1487 ms. (steps per millisecond=672 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5 resets, run finished after 2526 ms. (steps per millisecond=395 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-12 21:27:37] [INFO ] Flow matrix only has 839 transitions (discarded 1 similar events)
// Phase 1: matrix 839 rows 569 cols
[2022-06-12 21:27:37] [INFO ] Computed 59 place invariants in 22 ms
[2022-06-12 21:27:37] [INFO ] [Real]Absence check using 59 positive place invariants in 33 ms returned sat
[2022-06-12 21:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:37] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2022-06-12 21:27:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:37] [INFO ] [Nat]Absence check using 59 positive place invariants in 31 ms returned sat
[2022-06-12 21:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:38] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2022-06-12 21:27:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-12 21:27:38] [INFO ] [Nat]Added 57 Read/Feed constraints in 25 ms returned sat
[2022-06-12 21:27:38] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-06-12 21:27:38] [INFO ] Computed and/alt/rep : 669/2420/668 causal constraints (skipped 168 transitions) in 134 ms.
[2022-06-12 21:27:43] [INFO ] Added : 354 causal constraints over 71 iterations in 5001 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-12 21:27:43] [INFO ] [Real]Absence check using 59 positive place invariants in 27 ms returned sat
[2022-06-12 21:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:44] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-12 21:27:44] [INFO ] [Real]Added 57 Read/Feed constraints in 18 ms returned sat
[2022-06-12 21:27:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:44] [INFO ] [Nat]Absence check using 59 positive place invariants in 29 ms returned sat
[2022-06-12 21:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:44] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2022-06-12 21:27:44] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:27:44] [INFO ] Computed and/alt/rep : 669/2420/668 causal constraints (skipped 168 transitions) in 71 ms.
[2022-06-12 21:27:49] [INFO ] Added : 343 causal constraints over 69 iterations in 4641 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-12 21:27:49] [INFO ] [Real]Absence check using 59 positive place invariants in 29 ms returned sat
[2022-06-12 21:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:49] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2022-06-12 21:27:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:50] [INFO ] [Nat]Absence check using 59 positive place invariants in 30 ms returned sat
[2022-06-12 21:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:50] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2022-06-12 21:27:50] [INFO ] [Nat]Added 57 Read/Feed constraints in 25 ms returned sat
[2022-06-12 21:27:50] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:27:50] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:27:50] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:27:50] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:27:51] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 8 ms to minimize.
[2022-06-12 21:27:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 708 ms
[2022-06-12 21:27:51] [INFO ] Computed and/alt/rep : 669/2420/668 causal constraints (skipped 168 transitions) in 60 ms.
[2022-06-12 21:27:55] [INFO ] Added : 306 causal constraints over 62 iterations in 4151 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 21:27:55] [INFO ] [Real]Absence check using 59 positive place invariants in 26 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:55] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-06-12 21:27:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:55] [INFO ] [Nat]Absence check using 59 positive place invariants in 27 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:56] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-12 21:27:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:27:56] [INFO ] Computed and/alt/rep : 669/2420/668 causal constraints (skipped 168 transitions) in 61 ms.
[2022-06-12 21:28:00] [INFO ] Added : 329 causal constraints over 67 iterations in 4559 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 21:28:01] [INFO ] [Real]Absence check using 59 positive place invariants in 30 ms returned sat
[2022-06-12 21:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:01] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2022-06-12 21:28:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:01] [INFO ] [Nat]Absence check using 59 positive place invariants in 28 ms returned sat
[2022-06-12 21:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:01] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2022-06-12 21:28:01] [INFO ] [Nat]Added 57 Read/Feed constraints in 24 ms returned sat
[2022-06-12 21:28:02] [INFO ] Computed and/alt/rep : 669/2420/668 causal constraints (skipped 168 transitions) in 61 ms.
[2022-06-12 21:28:06] [INFO ] Added : 344 causal constraints over 70 iterations in 4693 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 94200 steps, including 537 resets, run finished after 438 ms. (steps per millisecond=215 ) properties (out of 5) seen :3 could not realise parikh vector
FORMULA NoC3x3-PT-3B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 97200 steps, including 591 resets, run finished after 379 ms. (steps per millisecond=256 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 79100 steps, including 544 resets, run finished after 277 ms. (steps per millisecond=285 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA NoC3x3-PT-3B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 83700 steps, including 427 resets, run finished after 293 ms. (steps per millisecond=285 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 94000 steps, including 529 resets, run finished after 341 ms. (steps per millisecond=275 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 20 out of 569 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 569/569 places, 840/840 transitions.
Graph (trivial) has 176 edges and 569 vertex of which 10 / 569 are part of one of the 4 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 563 transition count 813
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 546 transition count 812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 545 transition count 812
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 37 place count 545 transition count 792
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 77 place count 525 transition count 792
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 97 place count 505 transition count 748
Iterating global reduction 3 with 20 rules applied. Total rules applied 117 place count 505 transition count 748
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 505 transition count 746
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 502 transition count 737
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 502 transition count 737
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 237 place count 446 transition count 681
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 250 place count 433 transition count 659
Iterating global reduction 4 with 13 rules applied. Total rules applied 263 place count 433 transition count 659
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 267 place count 433 transition count 655
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 274 place count 426 transition count 641
Iterating global reduction 5 with 7 rules applied. Total rules applied 281 place count 426 transition count 641
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 287 place count 426 transition count 635
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 289 place count 424 transition count 631
Iterating global reduction 6 with 2 rules applied. Total rules applied 291 place count 424 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 295 place count 424 transition count 627
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 303 place count 420 transition count 642
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 305 place count 418 transition count 636
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 418 transition count 636
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 308 place count 417 transition count 632
Iterating global reduction 7 with 1 rules applied. Total rules applied 309 place count 417 transition count 632
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 310 place count 416 transition count 630
Iterating global reduction 7 with 1 rules applied. Total rules applied 311 place count 416 transition count 630
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 319 place count 416 transition count 622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 321 place count 415 transition count 635
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 323 place count 415 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 324 place count 414 transition count 622
Iterating global reduction 8 with 1 rules applied. Total rules applied 325 place count 414 transition count 622
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 342 place count 414 transition count 605
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 366 place count 397 transition count 598
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 367 place count 397 transition count 597
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 369 place count 397 transition count 600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 371 place count 395 transition count 600
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 379 place count 395 transition count 600
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 380 place count 395 transition count 600
Applied a total of 380 rules in 337 ms. Remains 395 /569 variables (removed 174) and now considering 600/840 (removed 240) transitions.
Finished structural reductions, in 1 iterations. Remains : 395/569 places, 600/840 transitions.
[2022-06-12 21:28:08] [INFO ] Flatten gal took : 79 ms
[2022-06-12 21:28:08] [INFO ] Flatten gal took : 65 ms
[2022-06-12 21:28:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5962725023196350861.gal : 13 ms
[2022-06-12 21:28:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2094663108849579543.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/ReachabilityCardinality5962725023196350861.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2094663108849579543.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/ReachabilityCardinality5962725023196350861.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2094663108849579543.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2094663108849579543.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :18 after 29
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 66
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :66 after 2290
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2290 after 4615
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4615 after 12887
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12887 after 132076
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :132076 after 3.73921e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.73921e+06 after 4.00264e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.00264e+07 after 1.44797e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.44797e+10 after 1.08802e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.08802e+13 after 3.89355e+14
Detected timeout of ITS tools.
[2022-06-12 21:28:24] [INFO ] Flatten gal took : 55 ms
[2022-06-12 21:28:24] [INFO ] Applying decomposition
[2022-06-12 21:28:24] [INFO ] Flatten gal took : 52 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/graph3309112765472733110.txt, -o, /tmp/graph3309112765472733110.bin, -w, /tmp/graph3309112765472733110.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/graph3309112765472733110.bin, -l, -1, -v, -w, /tmp/graph3309112765472733110.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:28:24] [INFO ] Decomposing Gal with order
[2022-06-12 21:28:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:28:24] [INFO ] Removed a total of 1118 redundant transitions.
[2022-06-12 21:28:24] [INFO ] Flatten gal took : 110 ms
[2022-06-12 21:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 378 labels/synchronizations in 139 ms.
[2022-06-12 21:28:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1994702552801608815.gal : 10 ms
[2022-06-12 21:28:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6950149197154618975.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/ReachabilityCardinality1994702552801608815.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6950149197154618975.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/ReachabilityCardinality1994702552801608815.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6950149197154618975.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6950149197154618975.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 73
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :73 after 253
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :253 after 313
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :313 after 23089
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23089 after 135721
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :135721 after 1.92765e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.92765e+08 after 3.10215e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.10215e+08 after 2.49497e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.49497e+12 after 1.21497e+14
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10068322916014336018
[2022-06-12 21:28:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10068322916014336018
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/ltsmin10068322916014336018]
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/ltsmin10068322916014336018] 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/ltsmin10068322916014336018] 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)
Incomplete random walk after 1000000 steps, including 12061 resets, run finished after 4682 ms. (steps per millisecond=213 ) properties (out of 1) seen :0
Finished Best-First random walk after 622517 steps, including 427 resets, run visited all 1 properties in 1628 ms. (steps per millisecond=382 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
BK_STOP 1655069328035
--------------------
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-3B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is NoC3x3-PT-3B, 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 r161-smll-165277002700060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 '
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 ;