About the Execution of 2021-gold for StigmergyElection-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1647.056 | 117990.00 | 207835.00 | 748.70 | FFFTFTTTTFTTTTTF | 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-165463878500143.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500143
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.3K May 30 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 30 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 30 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 15K May 30 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 30 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 30 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 30 15:26 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 50M 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-10a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654733423411
Running Version 0
[2022-06-09 00:10:26] [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:10:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:10:29] [INFO ] Load time of PNML (sax parser for PT used): 3167 ms
[2022-06-09 00:10:29] [INFO ] Transformed 142 places.
[2022-06-09 00:10:30] [INFO ] Transformed 50162 transitions.
[2022-06-09 00:10:30] [INFO ] Found NUPN structural information;
[2022-06-09 00:10:30] [INFO ] Parsed PT model containing 142 places and 50162 transitions in 3571 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1271 ms. (steps per millisecond=7 ) properties (out of 16) seen :8
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :1
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-06-09 00:10:32] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
// Phase 1: matrix 2208 rows 142 cols
[2022-06-09 00:10:32] [INFO ] Computed 11 place invariants in 52 ms
[2022-06-09 00:10:32] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-06-09 00:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:33] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2022-06-09 00:10:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:10:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-09 00:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:34] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2022-06-09 00:10:35] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-09 00:10:35] [INFO ] [Nat]Added 2095 Read/Feed constraints in 449 ms returned sat
[2022-06-09 00:10:36] [INFO ] Deduced a trap composed of 13 places in 1233 ms of which 37 ms to minimize.
[2022-06-09 00:10:38] [INFO ] Deduced a trap composed of 13 places in 1138 ms of which 3 ms to minimize.
[2022-06-09 00:10:39] [INFO ] Deduced a trap composed of 12 places in 1299 ms of which 3 ms to minimize.
[2022-06-09 00:10:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-09 00:10:39] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 00:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:40] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2022-06-09 00:10:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:10:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-09 00:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:41] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2022-06-09 00:10:42] [INFO ] [Nat]Added 2095 Read/Feed constraints in 598 ms returned sat
[2022-06-09 00:10:43] [INFO ] Deduced a trap composed of 12 places in 1081 ms of which 2 ms to minimize.
[2022-06-09 00:10:44] [INFO ] Deduced a trap composed of 13 places in 1048 ms of which 2 ms to minimize.
[2022-06-09 00:10:45] [INFO ] Deduced a trap composed of 14 places in 827 ms of which 1 ms to minimize.
[2022-06-09 00:10:46] [INFO ] Deduced a trap composed of 13 places in 884 ms of which 1 ms to minimize.
[2022-06-09 00:10: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 1
[2022-06-09 00:10:46] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-09 00:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:47] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2022-06-09 00:10:47] [INFO ] [Real]Added 2095 Read/Feed constraints in 586 ms returned sat
[2022-06-09 00:10:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:10:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-09 00:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:48] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2022-06-09 00:10:48] [INFO ] [Nat]Added 2095 Read/Feed constraints in 484 ms returned sat
[2022-06-09 00:10:50] [INFO ] Deduced a trap composed of 12 places in 972 ms of which 3 ms to minimize.
[2022-06-09 00:10:50] [INFO ] Deduced a trap composed of 12 places in 800 ms of which 1 ms to minimize.
[2022-06-09 00:10:51] [INFO ] Deduced a trap composed of 12 places in 671 ms of which 1 ms to minimize.
[2022-06-09 00:10:52] [INFO ] Deduced a trap composed of 12 places in 540 ms of which 1 ms to minimize.
[2022-06-09 00:10:52] [INFO ] Deduced a trap composed of 12 places in 465 ms of which 0 ms to minimize.
[2022-06-09 00:10:53] [INFO ] Deduced a trap composed of 12 places in 903 ms of which 6 ms to minimize.
[2022-06-09 00:10:53] [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:10:53] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-06-09 00:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:54] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2022-06-09 00:10:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:10:54] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 00:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:55] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2022-06-09 00:10:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:10:55] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-06-09 00:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:56] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2022-06-09 00:10:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:10:56] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 00:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:10:57] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2022-06-09 00:10:57] [INFO ] Solution in real domain found non-integer solution.
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 51 out of 142 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 142/142 places, 2238/2238 transitions.
Graph (complete) has 501 edges and 142 vertex of which 137 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.66 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 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 0 with 36 rules applied. Total rules applied 37 place count 137 transition count 2197
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 50 place count 131 transition count 2190
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 55 place count 130 transition count 2186
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 62 place count 126 transition count 2183
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 62 place count 126 transition count 2175
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 78 place count 118 transition count 2175
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 83 place count 113 transition count 2170
Iterating global reduction 4 with 5 rules applied. Total rules applied 88 place count 113 transition count 2170
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 110 transition count 2167
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 110 transition count 2167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 110 transition count 2166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 107 place count 104 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 103 transition count 2159
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 103 transition count 2159
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 122 place count 103 transition count 2146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 102 transition count 2145
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 102 transition count 2143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 128 place count 100 transition count 2143
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 100 transition count 2143
Applied a total of 129 rules in 4141 ms. Remains 100 /142 variables (removed 42) and now considering 2143/2238 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/142 places, 2143/2238 transitions.
[2022-06-09 00:11:03] [INFO ] Flatten gal took : 770 ms
[2022-06-09 00:11:03] [INFO ] Flatten gal took : 344 ms
[2022-06-09 00:11:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3032029306031537438.gal : 140 ms
[2022-06-09 00:11:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1097913143703427339.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/ReachabilityCardinality3032029306031537438.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1097913143703427339.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/ReachabilityCardinality3032029306031537438.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1097913143703427339.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1097913143703427339.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :17 after 1945
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1945 after 18528
Detected timeout of ITS tools.
[2022-06-09 00:11:18] [INFO ] Flatten gal took : 377 ms
[2022-06-09 00:11:18] [INFO ] Applying decomposition
[2022-06-09 00:11:19] [INFO ] Flatten gal took : 362 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/graph12750455359849337624.txt, -o, /tmp/graph12750455359849337624.bin, -w, /tmp/graph12750455359849337624.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/graph12750455359849337624.bin, -l, -1, -v, -w, /tmp/graph12750455359849337624.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:11:20] [INFO ] Decomposing Gal with order
[2022-06-09 00:11:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:11:21] [INFO ] Removed a total of 20517 redundant transitions.
[2022-06-09 00:11:22] [INFO ] Flatten gal took : 1230 ms
[2022-06-09 00:11:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 380 ms.
[2022-06-09 00:11:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3978539465257427541.gal : 48 ms
[2022-06-09 00:11:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12500059640881889939.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/ReachabilityCardinality3978539465257427541.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12500059640881889939.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/ReachabilityCardinality3978539465257427541.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12500059640881889939.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12500059640881889939.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :19 after 16768
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :16768 after 68529
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :68529 after 822366
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9445899636497310384
[2022-06-09 00:11:37] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9445899636497310384
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/ltsmin9445899636497310384]
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/ltsmin9445899636497310384] 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/ltsmin9445899636497310384] 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 222765 steps, including 26 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen :{0=1, 2=1}
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2784 ms. (steps per millisecond=359 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2143 rows 100 cols
[2022-06-09 00:12:11] [INFO ] Computed 10 place invariants in 19 ms
[2022-06-09 00:12:11] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-09 00:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:12:12] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2022-06-09 00:12:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:12:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-09 00:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:12:12] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2022-06-09 00:12:14] [INFO ] State equation strengthened by 2088 read => feed constraints.
[2022-06-09 00:12:14] [INFO ] [Nat]Added 2088 Read/Feed constraints in 337 ms returned sat
[2022-06-09 00:12:15] [INFO ] Deduced a trap composed of 10 places in 874 ms of which 1 ms to minimize.
[2022-06-09 00:12:16] [INFO ] Deduced a trap composed of 10 places in 843 ms of which 1 ms to minimize.
[2022-06-09 00:12:17] [INFO ] Deduced a trap composed of 9 places in 759 ms of which 1 ms to minimize.
[2022-06-09 00:12:17] [INFO ] Deduced a trap composed of 9 places in 677 ms of which 1 ms to minimize.
[2022-06-09 00:12:18] [INFO ] Deduced a trap composed of 10 places in 521 ms of which 1 ms to minimize.
[2022-06-09 00:12:19] [INFO ] Deduced a trap composed of 9 places in 615 ms of which 1 ms to minimize.
[2022-06-09 00:12:20] [INFO ] Deduced a trap composed of 9 places in 949 ms of which 3 ms to minimize.
[2022-06-09 00:12:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 5769 ms
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.
BK_STOP 1654733541401
--------------------
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-10a"
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-10a, 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-165463878500143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10a.tgz
mv StigmergyElection-PT-10a 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 '
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 ;