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-165277002700059.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002700059
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069050939

Running Version 0
[2022-06-12 21:24:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:24:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:24:14] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2022-06-12 21:24:14] [INFO ] Transformed 2117 places.
[2022-06-12 21:24:14] [INFO ] Transformed 2435 transitions.
[2022-06-12 21:24:14] [INFO ] Found NUPN structural information;
[2022-06-12 21:24:14] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 416 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :6
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :2
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2022-06-12 21:24:15] [INFO ] Computed 66 place invariants in 53 ms
[2022-06-12 21:24:15] [INFO ] [Real]Absence check using 66 positive place invariants in 95 ms returned sat
[2022-06-12 21:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:17] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2022-06-12 21:24:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:24:19] [INFO ] [Real]Absence check using 66 positive place invariants in 84 ms returned unsat
[2022-06-12 21:24:19] [INFO ] [Real]Absence check using 66 positive place invariants in 105 ms returned sat
[2022-06-12 21:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:22] [INFO ] [Real]Absence check using state equation in 2485 ms returned sat
[2022-06-12 21:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:24:22] [INFO ] [Nat]Absence check using 66 positive place invariants in 150 ms returned sat
[2022-06-12 21:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:25] [INFO ] [Nat]Absence check using state equation in 2394 ms returned sat
[2022-06-12 21:24:27] [INFO ] Deduced a trap composed of 50 places in 1478 ms of which 8 ms to minimize.
[2022-06-12 21:24:28] [INFO ] Deduced a trap composed of 40 places in 973 ms of which 3 ms to minimize.
[2022-06-12 21:24:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 21:24:28] [INFO ] [Real]Absence check using 66 positive place invariants in 94 ms returned sat
[2022-06-12 21:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:30] [INFO ] [Real]Absence check using state equation in 1768 ms returned sat
[2022-06-12 21:24:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:24:31] [INFO ] [Nat]Absence check using 66 positive place invariants in 90 ms returned sat
[2022-06-12 21:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:32] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2022-06-12 21:24:33] [INFO ] Deduced a trap composed of 28 places in 524 ms of which 3 ms to minimize.
[2022-06-12 21:24:34] [INFO ] Deduced a trap composed of 63 places in 719 ms of which 2 ms to minimize.
[2022-06-12 21:24:35] [INFO ] Deduced a trap composed of 67 places in 603 ms of which 2 ms to minimize.
[2022-06-12 21:24:35] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 1 ms to minimize.
[2022-06-12 21:24:37] [INFO ] Deduced a trap composed of 7 places in 1959 ms of which 13 ms to minimize.
[2022-06-12 21:24:37] [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:24:38] [INFO ] [Real]Absence check using 66 positive place invariants in 83 ms returned sat
[2022-06-12 21:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:39] [INFO ] [Real]Absence check using state equation in 1261 ms returned sat
[2022-06-12 21:24:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:24:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 88 ms returned sat
[2022-06-12 21:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:41] [INFO ] [Nat]Absence check using state equation in 1494 ms returned sat
[2022-06-12 21:24:42] [INFO ] Deduced a trap composed of 78 places in 923 ms of which 2 ms to minimize.
[2022-06-12 21:24:43] [INFO ] Deduced a trap composed of 29 places in 891 ms of which 1 ms to minimize.
[2022-06-12 21:24:44] [INFO ] Deduced a trap composed of 66 places in 609 ms of which 1 ms to minimize.
[2022-06-12 21:24:45] [INFO ] Deduced a trap composed of 97 places in 702 ms of which 2 ms to minimize.
[2022-06-12 21:24:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Support contains 32 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1695 edges and 2117 vertex of which 56 / 2117 are part of one of the 7 SCC in 18 ms
Free SCC test removed 49 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 433 rules applied. Total rules applied 434 place count 2063 transition count 1951
Reduce places removed 428 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 432 rules applied. Total rules applied 866 place count 1635 transition count 1947
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 10 rules applied. Total rules applied 876 place count 1633 transition count 1939
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 884 place count 1625 transition count 1939
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 884 place count 1625 transition count 1913
Deduced a syphon composed of 26 places in 6 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 936 place count 1599 transition count 1913
Discarding 354 places :
Symmetric choice reduction at 4 with 354 rule applications. Total rules 1290 place count 1245 transition count 1559
Iterating global reduction 4 with 354 rules applied. Total rules applied 1644 place count 1245 transition count 1559
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1644 place count 1245 transition count 1522
Deduced a syphon composed of 37 places in 11 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1718 place count 1208 transition count 1522
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 1848 place count 1078 transition count 1355
Iterating global reduction 4 with 130 rules applied. Total rules applied 1978 place count 1078 transition count 1355
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 2108 place count 948 transition count 1210
Iterating global reduction 4 with 130 rules applied. Total rules applied 2238 place count 948 transition count 1210
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 2285 place count 901 transition count 1129
Iterating global reduction 4 with 47 rules applied. Total rules applied 2332 place count 901 transition count 1129
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
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 4 with 18 rules applied. Total rules applied 2350 place count 899 transition count 1113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2352 place count 897 transition count 1113
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 2385 place count 864 transition count 1080
Iterating global reduction 6 with 33 rules applied. Total rules applied 2418 place count 864 transition count 1080
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2426 place count 860 transition count 1076
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2430 place count 856 transition count 1076
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 2452 place count 834 transition count 1032
Iterating global reduction 8 with 22 rules applied. Total rules applied 2474 place count 834 transition count 1032
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 2496 place count 812 transition count 1010
Iterating global reduction 8 with 22 rules applied. Total rules applied 2518 place count 812 transition count 1010
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 31 rules applied. Total rules applied 2549 place count 807 transition count 984
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2553 place count 803 transition count 984
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 10 with 622 rules applied. Total rules applied 3175 place count 492 transition count 673
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3189 place count 478 transition count 659
Iterating global reduction 10 with 14 rules applied. Total rules applied 3203 place count 478 transition count 659
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 3213 place count 468 transition count 639
Iterating global reduction 10 with 10 rules applied. Total rules applied 3223 place count 468 transition count 639
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3225 place count 468 transition count 637
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3227 place count 466 transition count 633
Iterating global reduction 11 with 2 rules applied. Total rules applied 3229 place count 466 transition count 633
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 3265 place count 448 transition count 648
Free-agglomeration rule applied 41 times.
Iterating global reduction 11 with 41 rules applied. Total rules applied 3306 place count 448 transition count 607
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 52 rules applied. Total rules applied 3358 place count 407 transition count 596
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 3364 place count 407 transition count 590
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 3369 place count 407 transition count 585
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 3374 place count 402 transition count 585
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 3382 place count 402 transition count 585
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3383 place count 402 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3384 place count 401 transition count 584
Applied a total of 3384 rules in 1251 ms. Remains 401 /2117 variables (removed 1716) and now considering 584/2435 (removed 1851) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/2117 places, 584/2435 transitions.
[2022-06-12 21:24:47] [INFO ] Flatten gal took : 141 ms
[2022-06-12 21:24:47] [INFO ] Flatten gal took : 73 ms
[2022-06-12 21:24:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9011161941434281056.gal : 36 ms
[2022-06-12 21:24:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3133183099671627578.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/ReachabilityCardinality9011161941434281056.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3133183099671627578.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/ReachabilityCardinality9011161941434281056.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3133183099671627578.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3133183099671627578.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :18 after 56
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :56 after 220
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :220 after 814
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :814 after 7132
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :7132 after 14998
Invariant property NoC3x3-PT-3B-ReachabilityCardinality-11 does not hold.
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14998 after 558197
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :558197 after 2.31556e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.31556e+06 after 3.73036e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.73036e+06 after 1.30737e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.30737e+07 after 8.95799e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.95799e+07 after 1.22427e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.22427e+08 after 2.67143e+09
Detected timeout of ITS tools.
[2022-06-12 21:25:02] [INFO ] Flatten gal took : 68 ms
[2022-06-12 21:25:02] [INFO ] Applying decomposition
[2022-06-12 21:25:02] [INFO ] Flatten gal took : 88 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/graph12759827761814806104.txt, -o, /tmp/graph12759827761814806104.bin, -w, /tmp/graph12759827761814806104.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/graph12759827761814806104.bin, -l, -1, -v, -w, /tmp/graph12759827761814806104.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:25:02] [INFO ] Decomposing Gal with order
[2022-06-12 21:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:25:03] [INFO ] Removed a total of 371 redundant transitions.
[2022-06-12 21:25:03] [INFO ] Flatten gal took : 231 ms
[2022-06-12 21:25:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 84 ms.
[2022-06-12 21:25:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1073635928050219014.gal : 37 ms
[2022-06-12 21:25:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11725493369940416958.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/ReachabilityCardinality1073635928050219014.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11725493369940416958.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/ReachabilityCardinality1073635928050219014.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11725493369940416958.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11725493369940416958.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 164
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :164 after 228
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :228 after 324
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :324 after 817500
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :817500 after 3.95847e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.95847e+11 after 1.64612e+13
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.64612e+13 after 2.50631e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.50631e+13 after 2.60044e+16
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8275181184453497575
[2022-06-12 21:25:18] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8275181184453497575
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/ltsmin8275181184453497575]
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/ltsmin8275181184453497575] 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/ltsmin8275181184453497575] 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 10133 resets, run finished after 4156 ms. (steps per millisecond=240 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 650 resets, run finished after 2341 ms. (steps per millisecond=427 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:25:25] [INFO ] Flow matrix only has 580 transitions (discarded 4 similar events)
// Phase 1: matrix 580 rows 401 cols
[2022-06-12 21:25:25] [INFO ] Computed 54 place invariants in 6 ms
[2022-06-12 21:25:25] [INFO ] [Real]Absence check using 54 positive place invariants in 19 ms returned sat
[2022-06-12 21:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:26] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-06-12 21:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:26] [INFO ] [Nat]Absence check using 54 positive place invariants in 31 ms returned sat
[2022-06-12 21:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:26] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-06-12 21:25:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-12 21:25:26] [INFO ] [Nat]Added 71 Read/Feed constraints in 34 ms returned sat
[2022-06-12 21:25:26] [INFO ] Computed and/alt/rep : 332/1816/328 causal constraints (skipped 250 transitions) in 61 ms.
[2022-06-12 21:25:29] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-12 21:25:29] [INFO ] Added : 190 causal constraints over 40 iterations in 2493 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Finished Parikh walk after 52067 steps, including 347 resets, run visited all 1 properties in 389 ms. (steps per millisecond=133 )
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655069130802

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-smll-165277002700059"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;