fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r305-smll-165463878400077
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for StigmergyCommit-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2073.680 189012.00 318602.00 1185.60 FTTTTTTFTFFFTTTF 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.r305-smll-165463878400077.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 StigmergyCommit-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 6.5K May 30 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 30 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.1K May 30 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 30 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 30 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 30 15:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 51M May 29 12:20 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 StigmergyCommit-PT-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654722112331

Running Version 0
[2022-06-08 21:01:55] [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-08 21:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 21:01:59] [INFO ] Load time of PNML (sax parser for PT used): 3513 ms
[2022-06-08 21:01:59] [INFO ] Transformed 364 places.
[2022-06-08 21:01:59] [INFO ] Transformed 50444 transitions.
[2022-06-08 21:01:59] [INFO ] Found NUPN structural information;
[2022-06-08 21:01:59] [INFO ] Parsed PT model containing 364 places and 50444 transitions in 3981 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1644 ms. (steps per millisecond=6 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-08 21:02:02] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2022-06-08 21:02:02] [INFO ] Computed 11 place invariants in 96 ms
[2022-06-08 21:02:02] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2022-06-08 21:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:03] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2022-06-08 21:02:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:04] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-08 21:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:05] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2022-06-08 21:02:05] [INFO ] State equation strengthened by 2185 read => feed constraints.
[2022-06-08 21:02:06] [INFO ] [Real]Added 2185 Read/Feed constraints in 778 ms returned sat
[2022-06-08 21:02:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-06-08 21:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:07] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2022-06-08 21:02:08] [INFO ] [Nat]Added 2185 Read/Feed constraints in 699 ms returned sat
[2022-06-08 21:02:09] [INFO ] Deduced a trap composed of 16 places in 1446 ms of which 18 ms to minimize.
[2022-06-08 21:02:11] [INFO ] Deduced a trap composed of 17 places in 1379 ms of which 3 ms to minimize.
[2022-06-08 21:02:12] [INFO ] Deduced a trap composed of 17 places in 1006 ms of which 2 ms to minimize.
[2022-06-08 21:02:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-08 21:02:12] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-06-08 21:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:13] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2022-06-08 21:02:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-06-08 21:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:14] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2022-06-08 21:02:15] [INFO ] [Nat]Added 2185 Read/Feed constraints in 1191 ms returned sat
[2022-06-08 21:02:17] [INFO ] Deduced a trap composed of 16 places in 1306 ms of which 2 ms to minimize.
[2022-06-08 21:02:18] [INFO ] Deduced a trap composed of 16 places in 1321 ms of which 2 ms to minimize.
[2022-06-08 21:02:18] [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-08 21:02:18] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-08 21:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:19] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2022-06-08 21:02:20] [INFO ] [Real]Added 2185 Read/Feed constraints in 691 ms returned sat
[2022-06-08 21:02:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2022-06-08 21:02:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:21] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2022-06-08 21:02:22] [INFO ] [Nat]Added 2185 Read/Feed constraints in 877 ms returned sat
[2022-06-08 21:02:23] [INFO ] Deduced a trap composed of 16 places in 1310 ms of which 2 ms to minimize.
[2022-06-08 21:02:25] [INFO ] Deduced a trap composed of 16 places in 1207 ms of which 2 ms to minimize.
[2022-06-08 21:02:26] [INFO ] Deduced a trap composed of 16 places in 1002 ms of which 1 ms to minimize.
[2022-06-08 21:02:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-08 21:02:26] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-08 21:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:27] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2022-06-08 21:02:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-08 21:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:28] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2022-06-08 21:02:29] [INFO ] [Nat]Added 2185 Read/Feed constraints in 974 ms returned sat
[2022-06-08 21:02:30] [INFO ] Deduced a trap composed of 16 places in 1193 ms of which 2 ms to minimize.
[2022-06-08 21:02:31] [INFO ] Deduced a trap composed of 19 places in 1121 ms of which 2 ms to minimize.
[2022-06-08 21:02:33] [INFO ] Deduced a trap composed of 17 places in 1176 ms of which 1 ms to minimize.
[2022-06-08 21:02:33] [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-08 21:02:33] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-08 21:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:34] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2022-06-08 21:02:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:34] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-06-08 21:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:35] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2022-06-08 21:02:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-06-08 21:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:35] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2022-06-08 21:02:36] [INFO ] [Nat]Added 2185 Read/Feed constraints in 900 ms returned sat
[2022-06-08 21:02:38] [INFO ] Deduced a trap composed of 17 places in 1160 ms of which 2 ms to minimize.
[2022-06-08 21:02:39] [INFO ] Deduced a trap composed of 16 places in 1209 ms of which 1 ms to minimize.
[2022-06-08 21:02:40] [INFO ] Deduced a trap composed of 16 places in 968 ms of which 1 ms to minimize.
[2022-06-08 21:02:40] [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-08 21:02:40] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-08 21:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:41] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2022-06-08 21:02:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-08 21:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:42] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2022-06-08 21:02:43] [INFO ] [Nat]Added 2185 Read/Feed constraints in 925 ms returned sat
[2022-06-08 21:02:45] [INFO ] Deduced a trap composed of 16 places in 1488 ms of which 1 ms to minimize.
[2022-06-08 21:02:46] [INFO ] Deduced a trap composed of 16 places in 1398 ms of which 1 ms to minimize.
[2022-06-08 21:02:46] [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
[2022-06-08 21:02:46] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-08 21:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:47] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2022-06-08 21:02:48] [INFO ] [Real]Added 2185 Read/Feed constraints in 891 ms returned sat
[2022-06-08 21:02:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-08 21:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:49] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2022-06-08 21:02:50] [INFO ] [Nat]Added 2185 Read/Feed constraints in 813 ms returned sat
[2022-06-08 21:02:52] [INFO ] Deduced a trap composed of 16 places in 1396 ms of which 1 ms to minimize.
[2022-06-08 21:02:53] [INFO ] Deduced a trap composed of 16 places in 1259 ms of which 1 ms to minimize.
[2022-06-08 21:02:54] [INFO ] Deduced a trap composed of 16 places in 903 ms of which 11 ms to minimize.
[2022-06-08 21:02:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2022-06-08 21:02:54] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-06-08 21:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:55] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2022-06-08 21:02:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:02:55] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-08 21:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:02:56] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2022-06-08 21:02:56] [INFO ] Solution in real domain found non-integer solution.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 51 out of 364 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 355 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.69 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 355 transition count 2447
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 60 rules applied. Total rules applied 125 place count 321 transition count 2421
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 315 transition count 2415
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 147 place count 309 transition count 2411
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 147 place count 309 transition count 2351
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 267 place count 249 transition count 2351
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 309 place count 207 transition count 2309
Iterating global reduction 4 with 42 rules applied. Total rules applied 351 place count 207 transition count 2309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 354 place count 207 transition count 2306
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 383 place count 178 transition count 2275
Iterating global reduction 5 with 29 rules applied. Total rules applied 412 place count 178 transition count 2275
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 419 place count 178 transition count 2268
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 426 place count 171 transition count 2261
Iterating global reduction 6 with 7 rules applied. Total rules applied 433 place count 171 transition count 2261
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 445 place count 171 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 447 place count 169 transition count 2247
Iterating global reduction 7 with 2 rules applied. Total rules applied 449 place count 169 transition count 2247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 450 place count 169 transition count 2246
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 472 place count 158 transition count 2235
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 476 place count 158 transition count 2231
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 482 place count 152 transition count 2225
Iterating global reduction 9 with 6 rules applied. Total rules applied 488 place count 152 transition count 2225
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 491 place count 149 transition count 2222
Iterating global reduction 9 with 3 rules applied. Total rules applied 494 place count 149 transition count 2222
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 496 place count 147 transition count 2220
Iterating global reduction 9 with 2 rules applied. Total rules applied 498 place count 147 transition count 2220
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 510 place count 147 transition count 2208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 514 place count 145 transition count 2206
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 516 place count 143 transition count 2204
Iterating global reduction 9 with 2 rules applied. Total rules applied 518 place count 143 transition count 2204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 519 place count 143 transition count 2203
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 531 place count 143 transition count 2191
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 543 place count 131 transition count 2191
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 544 place count 131 transition count 2190
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 552 place count 131 transition count 2190
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 558 place count 131 transition count 2184
Applied a total of 558 rules in 7408 ms. Remains 131 /364 variables (removed 233) and now considering 2184/2520 (removed 336) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/364 places, 2184/2520 transitions.
[2022-06-08 21:03:05] [INFO ] Flatten gal took : 718 ms
[2022-06-08 21:03:06] [INFO ] Flatten gal took : 347 ms
[2022-06-08 21:03:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7473109147624136605.gal : 108 ms
[2022-06-08 21:03:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1026030953113113439.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/ReachabilityCardinality7473109147624136605.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1026030953113113439.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/ReachabilityCardinality7473109147624136605.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1026030953113113439.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1026030953113113439.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 25
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :25 after 76
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :76 after 1193
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1193 after 1449
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1449 after 2417
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2417 after 40001
Detected timeout of ITS tools.
[2022-06-08 21:03:21] [INFO ] Flatten gal took : 370 ms
[2022-06-08 21:03:21] [INFO ] Applying decomposition
[2022-06-08 21:03:22] [INFO ] Flatten gal took : 376 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/graph14809409514257219411.txt, -o, /tmp/graph14809409514257219411.bin, -w, /tmp/graph14809409514257219411.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/graph14809409514257219411.bin, -l, -1, -v, -w, /tmp/graph14809409514257219411.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 21:03:23] [INFO ] Decomposing Gal with order
[2022-06-08 21:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 21:03:24] [INFO ] Removed a total of 20458 redundant transitions.
[2022-06-08 21:03:24] [INFO ] Flatten gal took : 1448 ms
[2022-06-08 21:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 520 ms.
[2022-06-08 21:03:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12844840115987912499.gal : 41 ms
[2022-06-08 21:03:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16644275012802584381.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/ReachabilityCardinality12844840115987912499.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16644275012802584381.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/ReachabilityCardinality12844840115987912499.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16644275012802584381.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16644275012802584381.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1.4976e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13842961495495677297
[2022-06-08 21:03:40] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13842961495495677297
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/ltsmin13842961495495677297]
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/ltsmin13842961495495677297] 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/ltsmin13842961495495677297] 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)
Interrupted random walk after 144513 steps, including 4 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{2=1, 5=1, 6=1}
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1358 ms. (steps per millisecond=736 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3774 ms. (steps per millisecond=264 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1415 ms. (steps per millisecond=706 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2184 rows 131 cols
[2022-06-08 21:04:19] [INFO ] Computed 10 place invariants in 27 ms
[2022-06-08 21:04:19] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-06-08 21:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:04:20] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2022-06-08 21:04:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:04:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-08 21:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:04:20] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-08 21:04:21] [INFO ] State equation strengthened by 2122 read => feed constraints.
[2022-06-08 21:04:22] [INFO ] [Nat]Added 2122 Read/Feed constraints in 351 ms returned sat
[2022-06-08 21:04:23] [INFO ] Deduced a trap composed of 8 places in 886 ms of which 2 ms to minimize.
[2022-06-08 21:04:24] [INFO ] Deduced a trap composed of 6 places in 928 ms of which 1 ms to minimize.
[2022-06-08 21:04:25] [INFO ] Deduced a trap composed of 10 places in 801 ms of which 1 ms to minimize.
[2022-06-08 21:04:25] [INFO ] Deduced a trap composed of 8 places in 794 ms of which 1 ms to minimize.
[2022-06-08 21:04:26] [INFO ] Deduced a trap composed of 8 places in 940 ms of which 1 ms to minimize.
[2022-06-08 21:04:27] [INFO ] Deduced a trap composed of 9 places in 726 ms of which 0 ms to minimize.
[2022-06-08 21:04:28] [INFO ] Deduced a trap composed of 9 places in 1011 ms of which 1 ms to minimize.
[2022-06-08 21:04:29] [INFO ] Deduced a trap composed of 9 places in 819 ms of which 0 ms to minimize.
[2022-06-08 21:04:30] [INFO ] Deduced a trap composed of 9 places in 597 ms of which 1 ms to minimize.
[2022-06-08 21:04:31] [INFO ] Deduced a trap composed of 8 places in 537 ms of which 1 ms to minimize.
[2022-06-08 21:04:31] [INFO ] Deduced a trap composed of 9 places in 555 ms of which 17 ms to minimize.
[2022-06-08 21:04:32] [INFO ] Deduced a trap composed of 8 places in 628 ms of which 1 ms to minimize.
[2022-06-08 21:04:33] [INFO ] Deduced a trap composed of 7 places in 628 ms of which 1 ms to minimize.
[2022-06-08 21:04:33] [INFO ] Deduced a trap composed of 9 places in 530 ms of which 1 ms to minimize.
[2022-06-08 21:04:34] [INFO ] Deduced a trap composed of 9 places in 439 ms of which 0 ms to minimize.
[2022-06-08 21:04:34] [INFO ] Deduced a trap composed of 9 places in 538 ms of which 1 ms to minimize.
[2022-06-08 21:04:35] [INFO ] Deduced a trap composed of 7 places in 609 ms of which 1 ms to minimize.
[2022-06-08 21:04:36] [INFO ] Deduced a trap composed of 10 places in 555 ms of which 1 ms to minimize.
[2022-06-08 21:04:36] [INFO ] Deduced a trap composed of 7 places in 557 ms of which 1 ms to minimize.
[2022-06-08 21:04:37] [INFO ] Deduced a trap composed of 7 places in 561 ms of which 1 ms to minimize.
[2022-06-08 21:04:37] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 1 ms to minimize.
[2022-06-08 21:04:38] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2022-06-08 21:04:38] [INFO ] Deduced a trap composed of 7 places in 464 ms of which 1 ms to minimize.
[2022-06-08 21:04:39] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 1 ms to minimize.
[2022-06-08 21:04:39] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 1 ms to minimize.
[2022-06-08 21:04:40] [INFO ] Deduced a trap composed of 7 places in 454 ms of which 1 ms to minimize.
[2022-06-08 21:04:40] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 1 ms to minimize.
[2022-06-08 21:04:40] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 1 ms to minimize.
[2022-06-08 21:04:41] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 1 ms to minimize.
[2022-06-08 21:04:41] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-06-08 21:04:41] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 19163 ms
[2022-06-08 21:04:42] [INFO ] Computed and/alt/rep : 126/202/126 causal constraints (skipped 2057 transitions) in 1001 ms.
[2022-06-08 21:04:45] [INFO ] Added : 123 causal constraints over 25 iterations in 4500 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-08 21:04:46] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 21:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:04:46] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2022-06-08 21:04:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:04:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-08 21:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:04:47] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-08 21:04:47] [INFO ] [Nat]Added 2122 Read/Feed constraints in 337 ms returned sat
[2022-06-08 21:04:48] [INFO ] Deduced a trap composed of 7 places in 793 ms of which 0 ms to minimize.
[2022-06-08 21:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 849 ms
[2022-06-08 21:04:48] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-08 21:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:04:49] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-06-08 21:04:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:04:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 21:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:04:49] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-06-08 21:04:50] [INFO ] [Nat]Added 2122 Read/Feed constraints in 325 ms returned sat
[2022-06-08 21:04:50] [INFO ] Deduced a trap composed of 7 places in 504 ms of which 1 ms to minimize.
[2022-06-08 21:04:51] [INFO ] Deduced a trap composed of 8 places in 390 ms of which 1 ms to minimize.
[2022-06-08 21:04:51] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2022-06-08 21:04:51] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2022-06-08 21:04:52] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2022-06-08 21:04:52] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 0 ms to minimize.
[2022-06-08 21:04:52] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 0 ms to minimize.
[2022-06-08 21:04:53] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2022-06-08 21:04:53] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2022-06-08 21:04:53] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2022-06-08 21:04:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3668 ms
[2022-06-08 21:04:54] [INFO ] Computed and/alt/rep : 126/202/126 causal constraints (skipped 2057 transitions) in 868 ms.
[2022-06-08 21:04:58] [INFO ] Deduced a trap composed of 9 places in 361 ms of which 1 ms to minimize.
[2022-06-08 21:04:59] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2022-06-08 21:04:59] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2022-06-08 21:04:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1394 ms
[2022-06-08 21:05:00] [INFO ] Added : 121 causal constraints over 25 iterations in 6359 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 40 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=6 )
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654722301343

--------------------
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="StigmergyCommit-PT-09a"
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 StigmergyCommit-PT-09a, 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 r305-smll-165463878400077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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