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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
658.155 49247.00 75529.00 462.00 TTTFFFTFTTFFTFFF 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-165463878500137.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 StigmergyElection-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-165463878500137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 5.7K May 30 15:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 30 15:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 30 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 30 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.4K May 30 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 30 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 15:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 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 17M 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 StigmergyElection-PT-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654733011296

Running Version 0
[2022-06-09 00:03:34] [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-09 00:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:03:36] [INFO ] Load time of PNML (sax parser for PT used): 1652 ms
[2022-06-09 00:03:36] [INFO ] Transformed 128 places.
[2022-06-09 00:03:36] [INFO ] Transformed 18490 transitions.
[2022-06-09 00:03:36] [INFO ] Found NUPN structural information;
[2022-06-09 00:03:36] [INFO ] Parsed PT model containing 128 places and 18490 transitions in 1907 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 884 ms. (steps per millisecond=11 ) properties (out of 12) seen :6
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2022-06-09 00:03:38] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2022-06-09 00:03:38] [INFO ] Computed 10 place invariants in 47 ms
[2022-06-09 00:03:38] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-09 00:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:39] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2022-06-09 00:03:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:03:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned unsat
[2022-06-09 00:03:39] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-06-09 00:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:40] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2022-06-09 00:03:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:03:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-09 00:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:40] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2022-06-09 00:03:40] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2022-06-09 00:03:41] [INFO ] [Nat]Added 1066 Read/Feed constraints in 661 ms returned sat
[2022-06-09 00:03:42] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 11 ms to minimize.
[2022-06-09 00:03:42] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 2 ms to minimize.
[2022-06-09 00:03:43] [INFO ] Deduced a trap composed of 13 places in 446 ms of which 2 ms to minimize.
[2022-06-09 00:03:43] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 2 ms to minimize.
[2022-06-09 00:03:44] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 1 ms to minimize.
[2022-06-09 00:03:44] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 1 ms to minimize.
[2022-06-09 00:03:45] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 1 ms to minimize.
[2022-06-09 00:03:45] [INFO ] Deduced a trap composed of 2 places in 667 ms of which 2 ms to minimize.
[2022-06-09 00:03: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 1
[2022-06-09 00:03:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-06-09 00:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:46] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2022-06-09 00:03:46] [INFO ] [Real]Added 1066 Read/Feed constraints in 548 ms returned sat
[2022-06-09 00:03:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:03:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-09 00:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:47] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-06-09 00:03:48] [INFO ] [Nat]Added 1066 Read/Feed constraints in 730 ms returned sat
[2022-06-09 00:03:48] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2022-06-09 00:03:49] [INFO ] Deduced a trap composed of 12 places in 538 ms of which 1 ms to minimize.
[2022-06-09 00:03:50] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 1 ms to minimize.
[2022-06-09 00:03:50] [INFO ] Deduced a trap composed of 13 places in 461 ms of which 1 ms to minimize.
[2022-06-09 00:03:51] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 1 ms to minimize.
[2022-06-09 00:03:51] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2022-06-09 00:03:52] [INFO ] Deduced a trap composed of 2 places in 667 ms of which 1 ms to minimize.
[2022-06-09 00:03:52] [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-09 00:03:52] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-09 00:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:53] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-06-09 00:03:53] [INFO ] [Real]Added 1066 Read/Feed constraints in 525 ms returned sat
[2022-06-09 00:03:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:03:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-06-09 00:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:54] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2022-06-09 00:03:54] [INFO ] [Nat]Added 1066 Read/Feed constraints in 558 ms returned sat
[2022-06-09 00:03:55] [INFO ] Deduced a trap composed of 13 places in 670 ms of which 2 ms to minimize.
[2022-06-09 00:03:56] [INFO ] Deduced a trap composed of 12 places in 533 ms of which 1 ms to minimize.
[2022-06-09 00:03:56] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 1 ms to minimize.
[2022-06-09 00:03:57] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 0 ms to minimize.
[2022-06-09 00:03:58] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 1 ms to minimize.
[2022-06-09 00:03:58] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2022-06-09 00:03:59] [INFO ] Deduced a trap composed of 2 places in 662 ms of which 1 ms to minimize.
[2022-06-09 00:03:59] [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-09 00:03:59] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-06-09 00:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:03:59] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2022-06-09 00:04:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:04:00] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-06-09 00:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:04:00] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2022-06-09 00:04:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:04:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-06-09 00:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:04:00] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2022-06-09 00:04:01] [INFO ] [Nat]Added 1066 Read/Feed constraints in 659 ms returned sat
[2022-06-09 00:04:02] [INFO ] Deduced a trap composed of 13 places in 639 ms of which 1 ms to minimize.
[2022-06-09 00:04:03] [INFO ] Deduced a trap composed of 13 places in 542 ms of which 1 ms to minimize.
[2022-06-09 00:04:03] [INFO ] Deduced a trap composed of 12 places in 443 ms of which 1 ms to minimize.
[2022-06-09 00:04:04] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2022-06-09 00:04:05] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 0 ms to minimize.
[2022-06-09 00:04:05] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 1 ms to minimize.
[2022-06-09 00:04:06] [INFO ] Deduced a trap composed of 2 places in 676 ms of which 1 ms to minimize.
[2022-06-09 00:04:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Support contains 28 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1195/1195 transitions.
Graph (complete) has 424 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.38 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 123 transition count 1153
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 20 rules applied. Total rules applied 58 place count 114 transition count 1142
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 112 transition count 1138
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 72 place count 108 transition count 1134
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 72 place count 108 transition count 1125
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 90 place count 99 transition count 1125
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 100 place count 89 transition count 1115
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 89 transition count 1115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 85 transition count 1110
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 85 transition count 1110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 85 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 84 transition count 1107
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 84 transition count 1107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 124 place count 84 transition count 1105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 138 place count 77 transition count 1098
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 143 place count 72 transition count 1093
Iterating global reduction 6 with 5 rules applied. Total rules applied 148 place count 72 transition count 1093
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 153 place count 72 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 157 place count 70 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 69 transition count 1085
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 69 transition count 1085
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 69 transition count 1084
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 69 transition count 1083
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 68 transition count 1083
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 68 transition count 1083
Applied a total of 163 rules in 2128 ms. Remains 68 /128 variables (removed 60) and now considering 1083/1195 (removed 112) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/128 places, 1083/1195 transitions.
[2022-06-09 00:04:09] [INFO ] Flatten gal took : 357 ms
[2022-06-09 00:04:09] [INFO ] Flatten gal took : 182 ms
[2022-06-09 00:04:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality875080826483766733.gal : 67 ms
[2022-06-09 00:04:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13857104669922695608.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/ReachabilityCardinality875080826483766733.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13857104669922695608.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/ReachabilityCardinality875080826483766733.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13857104669922695608.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13857104669922695608.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 41
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :41 after 113
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :113 after 145
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :145 after 2855
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2855 after 6145
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6145 after 11396
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :11396 after 18308
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,65165,10.079,157508,2,5768,13,79761,10,0,1393,45972,0
Total reachable state count : 65165

Verifying 4 reachability properties.
Invariant property StigmergyElection-PT-09a-ReachabilityCardinality-02 is true.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-09a-ReachabilityCardinality-02,0,10.085,157508,1,0,13,79761,10,0,1403,45972,0
Reachability property StigmergyElection-PT-09a-ReachabilityCardinality-03 does not hold.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
No reachable states exhibit your property : StigmergyElection-PT-09a-ReachabilityCardinality-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-09a-ReachabilityCardinality-03,0,10.0976,157508,1,0,13,79761,10,0,1427,45972,0
Reachability property StigmergyElection-PT-09a-ReachabilityCardinality-08 is true.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-09a-ReachabilityCardinality-08,1,10.0978,157508,2,69,13,79761,10,0,1428,45972,0
Invariant property StigmergyElection-PT-09a-ReachabilityCardinality-13 does not hold.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-09a-ReachabilityCardinality-13,1,10.1005,157508,2,69,13,79761,10,0,1430,45972,0
All properties solved without resorting to model-checking.

BK_STOP 1654733060543

--------------------
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="StigmergyElection-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 StigmergyElection-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-165463878500137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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